On Representatives of Subsets

Cited in

(only showing first 100 items - show all)

Upper bounds on the paired-domination number
On mod \((2p+1)\)-orientations of graphs
Non-manipulable assignment of individuals to positions revisited
Conditional matching preclusion sets
Indivisible plexes in Latin squares
Partnership formation and binomial semivalues
Menger's theorem for infinite graphs
Primitive permutation groups and their section-regular partitions.
Short containers in Cayley graphs
Linear CNF formulas and satisfiability
Number of mutual connections in neighborhoods and its application to self-diagnosable systems
Minor and minimum cycle bases of a 3-connected planar graph
Complexities of some interesting problems on spanning trees
On list critical graphs
The Erdős-Ko-Rado properties of set systems defined by double partitions
Minimum degree of minimal defect n-extendable bipartite graphs
Embeddings of \(P_{3}\)-designs into bowtie and almost bowtie systems
On a generalized matching problem arising in estimating the eigenvalue variation of two matrices
On the equivalence of two conditions for the existence of transversals
Conditions for the existence of a system of different set representatives
Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
On factors with all degrees odd
Some sequences associated with combinatorial structures
Multipartite graph-sparse graph Ramsey numbers
Subgraphs intersecting any Hamiltonian cycle
Goodness of trees for generalized books
Maximum of k-th maximal spanning trees of a weighted graph
Model robust optimal designs for comparing test treatments with a control
Matchings in infinite graphs
On k-transversals
A matroid on hypergraphs, with applications in scene analysis and geometry
On an application of Hall's representatives theorem to a finite geometry problem
Extremal theory and bipartite graph-tree Ramsey numbers
On the number of SDR of a (t,n)-family
The two ear theorem on matching-covered graphs
Hall-conditions and the three-family problem
Systems of distinct representatives for k families of sets
Completing partial latin squares
Hall families and the marriage problem
Ensembles d'articulation d'un graphe -critique
On n-extendable graphs
Subgraphs and their degree sequences of a digraph
Dividing a cake fairly
The complexity of testing whether a graph is a superconcentrator
On two-factors of bipartite regular graphs
Graph factors
A combinatorial problem involving graphs and matrices
Triangle-free partial graphs and edge covering theorems
Neighborhood conditions and edge-disjoint perfect matchings
Matchings and cycle covers in random digraphs
The symbiotic relationship of combinatorics and matrix theory
A structure theorem for maximum internal matchings in graphs
An implicit data structure for searching a multikey table in logarithmic time
Infinite matching theory
A comparison theorem for permanents and a proof of a conjecture on \((t,m)\)-families
The notion and basic properties of M-transversals
The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
Matching theory -- a sampler: From Dénes König to the present
The strong chromatic index of a cubic graph is at most 10
On existence of sets of distinct representatives for families of subsets of a multiset
The asymptotic number of (0,1)-matrices with zero permanent
The semigroup of Hall relations
The morphology of partially ordered sets
The cardinal module and some theorems on families of sets
Truncations of principal geometries
Necessary and sufficient conditions for transversals of countable set systems
Marriage in denumerable societies
A number-theoretic function related to Latin squares
Mutually disjoint families of 0-1 sequences
Independent transversals for countable set systems
Ergebnisse aus der Transversalentheorie. I, II
Score vectors of tournaments
Common transversals
On the number of systems of distinct representatives in an independence structure
Embedding incomplete double diagonal latin squares
Graph with given achromatic number
Identification of simultaneous equation models with measurement error
Local matching in the function space of a partial order
Common transversals in partitioning families
Injective choice functions for countable families
Decomposition of nonnegative integral matrices
Transversal theory and rank functions
Modifications of object sizes and box capacities to achieve a simultaneous fitting
A theorem of the transversal theory for matroids of finite character
Covering digraphs by paths
An arithmetic characterization of the rational homotopy groups of certain spaces
Maximum antichains in the partition lattice
Distinct representatives, varieties and rational homotopy
Optimal block designs for comparing test treatments with a control when \(k>v\)
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Decomposition of infinite matrices
On the n-cutset property
Matroids on partially ordered sets
The Hall number, the Hall index, and the total Hall number of a graph
The Suslin number of the functor of probability measures
Two classes of q-ary codes based on group divisible association schemes
Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs
The strong Hall property and symmetric chain orders
On graphs \(G\) for which all large trees are \(G\)-good
Cell decompositions of C-minimal structures

This page was built for publication: On Representatives of Subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4760022)