On Representatives of Subsets
From MaRDI portal
Publication:4760022
Cited in
(only showing first 100 items - show all)- Ramsey Numbers for the Pair Sparse Graph-Path or Cycle
- Two classes of q-ary codes based on group divisible association schemes
- On a conjecture of Füredi.
- A generalization of Hungarian method and Hall's theorem with applications in wireless sensor networks
- The semigroup of Hall relations
- Some sequences associated with combinatorial structures
- Geometry and the simplex: results, questions and ideas
- Reverse mathematics and marriage problems with unique solutions
- Construction and optimality of nearly linear trend-free designs
- The women of Cairo: equilibria in large anonymous games
- On chromatic‐choosable graphs
- A New Description of Transversal Matroids Through Rough Set Approach
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
- On odd circuits in chromatic graphs
- Pancyclic BIBD block-intersection graphs
- DIAGRAMS WITH SELECTION AND METHOD FOR CONSTRUCTING BOUNDEDLY GENERATED AND BOUNDEDLY SIMPLE GROUPS
- Graphs with each edge in at most one maximum matching
- Covering digraphs by paths
- Goodness of trees for generalized books
- Modifications of object sizes and box capacities to achieve a simultaneous fitting
- Transversal theory and rank functions
- Remarks on proper conflict-free colorings of graphs
- Characterizations of transversal matroids and their presentations
- Identifying restrictions of linear equations with applications to simultaneous equations and cointegration
- Matchings and cycle covers in random digraphs
- Edge-chromatic numbers of Mycielski graphs
- Network games with and without synchroneity
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
- Expansion and contraction functors on matriods
- Bargaining and network structure: an experiment
- Integer and fractional security in graphs
- Matchings in arbitrary groups.
- The 1-width of (0,1)-matrices having constant row sum 3
- Mutually disjoint families of 0-1 sequences
- Hall number for list colorings of graphs: Extremal results
- Methods of solving some personnel-classification problems
- Sparse hypergraphs with applications to coding theory
- On a possible extension of Hall's theorem to bipartite hypergraphs
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes
- Extension of partial diagonals of matrices. II
- Three-regular parts of four-regular graphs
- Three‐regular subgraphs of four‐regular graphs
- Constructions of doubly resolvable Steiner quadruple systems
- Perfect matchings in hexagonal systems
- Properties of vertex cover obstructions
- Kidney exchange: an egalitarian mechanism
- New integer linear programming approaches for course timetabling
- Planar 3-SAT with a clause/variable cycle
- A theorem of the transversal theory for matroids of finite character
- The dimension of random ordered sets
- A nonasymptotic approach to analyzing kidney exchange graphs
- Eine neue Definition der fastperiodischen Funktionen
- Conditional matching preclusion sets
- Finding all maximally-matchable edges in a bipartite graph
- Rank of adjacency matrices of directed (strongly) regular graphs
- Coarse equivalence versus bijective coarse equivalence of expander graphs
- A substitute for Hall's theorem for families with infinite sets
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Derived invariants for surface cut algebras of global dimension 2. II: The punctured case
- Multiple choice tries and distributed hash tables
- Generalized versions of Hall's theorem
- Exploring the complexity boundary between coloring and list-coloring
- Regular Hypertournaments and Arc-Pancyclicity
- A note on 3-distance coloring of planar graphs
- The Suslin number of the functor of probability measures
- Small embeddings of partial Steiner triple systems
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- Decomposition of nonnegative integral matrices
- Optimal block designs for comparing test treatments with a control when \(k>v\)
- A monotone Sinai theorem
- Plünnecke's inequality
- Chessboard squares
- A theory of nonmonotonic rule systems I
- The Hall number, the Hall index, and the total Hall number of a graph
- Characterizing defect n-extendable bipartite graphs with different connectivities
- On the 2-factors of bicubic graphs
- On a distribution problem in finite and countable sets
- Pairwise kidney exchange
- Maximum antichains in the partition lattice
- Distinct representatives, varieties and rational homotopy
- Decomposition of infinite matrices
- scientific article; zbMATH DE number 495474 (Why is no real title available?)
- The morphology of partially ordered sets
- Solution to a problem of Katona on counting cliques of weighted graphs
- Typical case complexity of satisfiability algorithms and the threshold phenomenon
- Crown reductions for the minimum weighted vertex cover problem
- Primitive permutation groups and their section-regular partitions.
- A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem
- ReGale: some memorable results
- On 2-factor Hamiltonian regular bipartite graphs
- Discrete Gabor frames in \(\ell^2(\mathbb Z^d)\)
- A perspective on certain polynomial-time solvable classes of satisfiability
- RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
- On the balanced decomposition number
- A 3/2-approximation algorithm for the graph balancing problem with two weights
- Selected topics on assignment problems
- On bounded block decomposition problems for under-specified systems of equations
- Minimum degree thresholds for bipartite graph tiling
- Minimum degree of minimal defect \(n\)-extendable bipartite graphs
- Partial matroid representations
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)