Pages that link to "Item:Q1900519"
From MaRDI portal
The following pages link to A condition for matchability in hypergraphs (Q1900519):
Displayed 46 items.
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- On \((1, \epsilon )\)-restricted max-min fair allocation problem (Q724228) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Independence-domination duality (Q958688) (← links)
- On finite simple groups and Kneser graphs. (Q968241) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Almost perfect matchings in random uniform hypergraphs (Q1363674) (← links)
- Independence-domination duality in weighted graphs (Q1637152) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- \(d\)-matching in 3-uniform hypergraphs (Q1690241) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs (Q2023735) (← links)
- Matching orderable and separable hypergraphs (Q2136876) (← links)
- Restricted max-min allocation: integrality gap and approximation algorithm (Q2149096) (← links)
- Fair splittings by independent sets in sparse graphs (Q2182042) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- Sets of elements that pairwise generate a linear group (Q2426424) (← links)
- Independent systems of representatives in weighted graphs (Q2460628) (← links)
- Triangle resilience of the square of a Hamilton cycle in random graphs (Q2664554) (← links)
- The threshold bias of the clique-factor game (Q2664555) (← links)
- Separable and equatable hypergraphs (Q2696627) (← links)
- Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes (Q2833255) (← links)
- Sets of Elements that Pairwise Generate a Matrix Ring (Q2888566) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← links)
- The intersection of a matroid and a simplicial complex (Q3420348) (← links)
- The Time Complexity of Constraint Satisfaction (Q3503589) (← links)
- Santa Claus Meets Hypergraph Matchings (Q3541783) (← links)
- Acyclic systems of representatives and acyclic colorings of digraphs (Q3605147) (← links)
- Fair Representation by Independent Sets (Q4604368) (← links)
- Triangle‐factors in pseudorandom graphs (Q4968390) (← links)
- Finding independent transversals efficiently (Q4987260) (← links)
- A stochastic matching model on hypergraphs (Q5013243) (← links)
- (Q5091188) (← links)
- A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs (Q5135735) (← links)
- Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
- An asymptotic bound for the strong chromatic number (Q5222554) (← links)
- Matching criticality in intersecting hypergraphs (Q5236049) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- Covering cycles in sparse graphs (Q6074700) (← links)
- Colorings, transversals, and local sparsity (Q6074708) (← links)
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel (Q6076732) (← links)
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
- Choice functions (Q6105041) (← links)