On Representatives of Subsets

Cited in

(only showing first 100 items - show all)

The Hall number, the Hall index, and the total Hall number of a graph
On the completion of latin rectangles to symmetric latin squares
The 'marriage game': An assignment problem with indivisibilities
Separators and structure prediction in sparse orthogonal factorization
On a generalized matching problem arising in estimating the eigenvalue variation of two matrices
DIAGRAMS WITH SELECTION AND METHOD FOR CONSTRUCTING BOUNDEDLY GENERATED AND BOUNDEDLY SIMPLE GROUPS
Partial matroid representations
Some Monotonicity Properties of Partial Orders
Neighborhood conditions and edge-disjoint perfect matchings
Incidence properties of cosets in loops.
Uniform probability
Variations on instant insanity
Constructions of doubly resolvable Steiner quadruple systems
Small embeddings of partial Steiner triple systems
Lineare Programme und allgemeine Vertretersysteme
Partitioned transversals
Geometry and the simplex: results, questions and ideas
Efficient simulation of circuits by EREW PRAMs
Short cycle structure of graphs on surfaces. I: The uniqueness theorems
Construction and optimality of nearly linear trend-free designs
Transversal theory and the study of abstract independence
Fixed-point-free embeddings of digraphs with small size
An extremal problem on v-partite graphs
Hall's criterion as a 'self-refining' result
Subgraphs intersecting any Hamiltonian cycle
Saturating stable matchings
Walrasian's characterization and a universal ascending auction
The rank formula of Nash-Williams as a source of covering and packing theorems
Combinatorial formulae for multiple set-valued labellings
Deadlock-freedom in resource contentions
Symmetry and impartial lotteries
A packet filter placement problem with application to defense against spoofed denial of service attacks
Independence in 5-uniform hypergraphs
Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen
Set systems with finite chromatic number
Robust multivalued solutions for assignment problems: A note
Upper bound for linear arboricity
Model robust optimal designs for comparing test treatments with a control
Matchings in infinite graphs
On the equivalence of two conditions for the existence of transversals
List multicoloring problems involving the \(k\)-fold Hall numbers
The 1-width of (0,1)-matrices having constant row sum 3
Systems of distinct representatives. II
Balanced coloring of bipartite graphs
On k-transversals
An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
Existence of perfect matchings in a plane bipartite graph
Infinite matching theory
Partnership formation and binomial semivalues
A continuous generalization of the transversal property
Hall number for list colorings of graphs: Extremal results
Some E-optimal row-column designs having unequally replicated treatments
Two classes of \(q\)-ary codes based on group divisible association schemes
An interpolation theorem for partitions which are complete with respect to hereditary properties
Alliances, partnerships and the Banzhaf semivalue
Non-manipulable assignment of individuals to positions revisited
Score vectors of tournaments
Families of pairs of graphs with a large number of common cards
An analytic approach to stability
Entropic uncertainty relations and the stabilizer formalism
Extending Hall's theorem into list colorings: a partial history
Upper bounds on the paired-domination number
Graph factors and factorization: 1985--2003: a survey
Three‐regular subgraphs of four‐regular graphs
Inapproximability and approximability of maximal tree routing and coloring
Characterization of the Walrasian equilibria of the assignment model
An algorithm for identifying fair and optimal allocations
Eigenvalues and perfect matchings
On factorisation of graphs
\(k\)-restricted edge-connectivity in triangle-free graphs
Cell decompositions of \(C\)-minimal structures
The semigroup of Hall relations
Fully packed loops in a triangle: matchings, paths and puzzles
A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
The Erdős-Ko-Rado properties of set systems defined by double partitions
Near-automorphisms of Latin squares
The morphology of partially ordered sets
On bounded block decomposition problems for under-specified systems of equations
Pairwise kidney exchange
Ordinal efficiency and dominated sets of assignments.
Imbedding posets in the integers
Perfect matchings of a graph
Clique-perfectness of complements of line graphs
Indivisible plexes in Latin squares
Kidney exchange: an egalitarian mechanism
Edge-chromatic numbers of Mycielski graphs
On mod \((2p+1)\)-orientations of graphs
Primitive permutation groups and their section-regular partitions.
\((F, I)\)-security in graphs
Sets in excess demand in simple ascending auctions with unit-demand bidders
Orientations of graphs with prescribed weighted out-degrees
2-distance paired-dominating number of graphs
Pancyclic BIBD block-intersection graphs
Asymptotic multipartite version of the Alon-Yuster theorem
Short containers in Cayley graphs
Linear pencils of tropical plane curves
The intersection of a matroid and a simplicial complex
A Hall-type theorem for triplet set systems based on medians in trees
The English auction with differentiated commodities
Exploring the complexity boundary between coloring and list-coloring

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)