On Representatives of Subsets
From MaRDI portal
Publication:4760022
Cited in
(only showing first 100 items - show all)- An algorithm for identifying fair and optimal allocations
- Linear pencils of tropical plane curves
- Pancyclic PBD block-intersection graphs
- On mod \((2p+1)\)-orientations of graphs
- Refinements of Hall's condition
- A simplified NP-complete satisfiability problem
- On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
- The complexity of completing partial Latin squares
- An efficient bounds consistency algorithm for the global cardinality constraint
- Ohba's conjecture for graphs with independence number five
- On factorisation of graphs
- Computing large matchings in planar graphs with fixed minimum degree
- On the n-cutset property
- The discrete separation theorem and price adjustment directions in markets with heterogeneous commodities
- The cardinal module and some theorems on families of sets
- Kapranov rank vs. tropical rank
- Cross-intersecting families and primitivity of symmetric systems
- Extremal theory and bipartite graph-tree Ramsey numbers
- Equivalent subsets of a colored set
- Computing double cosets in soluble groups
- The complexity of testing whether a graph is a superconcentrator
- Score vectors of tournaments
- Space proof complexity for random 3-CNFs
- \(k\)-restricted edge-connectivity in triangle-free graphs
- Well-covered graphs and factors
- Eine neue Definition der fastperiodischen Funktionen.
- On 3-stage Clos networks with different nonblocking requirements on two types of calls
- Indivisible plexes in Latin squares
- A packet filter placement problem with application to defense against spoofed denial of service attacks
- Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen
- Short containers in Cayley graphs
- Minor and minimum cycle bases of a 3-connected planar graph
- No easy puzzles: hardness results for jigsaw puzzles
- Tropical determinant on transportation polytopes
- Transversal theory and the study of abstract independence
- Hall's criterion as a 'self-refining' result
- Cycles through all finite vertex sets in infinite graphs
- The rank formula of Nash-Williams as a source of covering and packing theorems
- Note on incidence chromatic number of subquartic graphs
- On classical and modern marriage problems
- Graph matching problems and the NP-hardness of sortedness constraints
- Embedding an incomplete latin square in a latin square with a prescribed diagonal
- scientific article; zbMATH DE number 7662164 (Why is no real title available?)
- On a k-tree containing specified leaves in a graph
- A theorem concerning perfect matchings in hexagonal systems
- A Helly Theorem for Sets
- Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
- Matching preclusion for vertex-transitive networks
- On the separation power and the completion of partial latin squares
- Integer programming models for mid-term production planning for high-tech low-volume supply chains
- Sweet \& sour and other flavours of ccc forcing notions
- Injective choice functions for countable families
- Edge-superconnectivity of semiregular cages with odd girth
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- On completing latin squares
- A network game with attackers and a defender
- Menger's theorem for infinite graphs
- Maximal-\(\Gamma\)-prime Graphen
- Stationary random metrics on hierarchical graphs via \((\min,+)\)-type recursive distributional equations
- Systems of distant representatives in Euclidean space
- Eigenvalues and perfect matchings
- Representation of systems of measurable sets
- Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
- On spanning trees with restricted degrees
- Sufficient conditions for 2-rainbow connected graphs
- Some results on characterizing the edges of connected graphs with a given domination number
- A matroid on hypergraphs, with applications in scene analysis and geometry
- Cake Cutting: An Envy-Free and Truthful Mechanism with a Small Number of Cuts
- Sharp threshold for embedding balanced spanning trees in random geometric graphs
- Avoiding partial Latin squares and intricacy
- Domination mappings into the Hamming ball: existence, constructions, and algorithms
- Integer partitions and the Sperner property
- Two remarks on the coloring number
- Tight bounds on maximal and maximum matchings
- Combinatorics of reductions between equivalence relations
- Turán-type results for complete h-partite graphs in comparability and incomparability graphs
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- Graphs without minor complete subgraphs
- The two ear theorem on matching-covered graphs
- Hall-conditions and the three-family problem
- Injective choice functions
- Systems of distinct representatives for k families of sets
- Completing partial latin squares
- Saturating stable matchings
- Zero forcing versus domination in cubic graphs
- Minimum cycle bases of graphs on surfaces
- Zero-sum flows in regular graphs
- Traceability in graphs with forbidden triples of subgraphs
- An analytic approach to stability
- The notion and basic properties of M-transversals
- An extension of Hall's theorem for partitioned bipartite graphs
- On finding augmenting graphs
- A proof of Sperner's lemma via Hall's theorem
- Unbiased version of Hall's marriage theorem in matrix form
- Remark on a criterion for common transversals
- Rado's theorem for polymatroids
- Incidence properties of cosets in loops.
- Minimean optimal key arrangements in hash tables
- Traffic assignment in communication satellites
- Some E-optimal row-column designs having unequally replicated treatments
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)
