The following pages link to Hall's theorem for hypergraphs (Q4518333):
Displaying 50 items.
- Almost-spanning universality in random graphs (extended abstract) (Q322227) (← links)
- 10-tough chordal graphs are Hamiltonian (extended abstract) (Q322253) (← links)
- 10-tough chordal graphs are Hamiltonian (Q345090) (← links)
- How many colors guarantee a rainbow matching? (Q405108) (← links)
- Total domination edge critical graphs with total domination number three and many dominating pairs (Q497305) (← links)
- On rainbow matchings in bipartite graphs (Q510529) (← links)
- Rainbow perfect matchings in \(r\)-partite graph structures (Q510578) (← links)
- A topological colorful Helly theorem (Q702702) (← links)
- On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (Q730257) (← links)
- A Hall-type theorem for triplet set systems based on medians in trees (Q847268) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Independence-domination duality (Q958688) (← links)
- Independence complexes of chordal graphs (Q982628) (← links)
- Vizing's conjecture for chordal graphs (Q1024500) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- Compatible systems of representatives (Q1336656) (← links)
- Domination numbers and homology (Q1395819) (← links)
- On a conjecture of Stein (Q1688259) (← links)
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs (Q1689904) (← links)
- On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs (Q1691092) (← links)
- Systems of distant representatives (Q1764814) (← links)
- Halin's theorem for cubic graphs on an annulus (Q1827692) (← links)
- Triangulated spheres and colored cliques (Q1864189) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- Rainbow simplices in triangulations of manifolds (Q1999728) (← links)
- Weighted domination of independent sets (Q2000566) (← links)
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs (Q2032871) (← links)
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) (Q2044310) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- Dirac-type theorems in random hypergraphs (Q2131868) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- Noncover complexes, independence complexes, and domination numbers of hypergraphs (Q2199838) (← links)
- Domination numbers and noncover complexes of hypergraphs (Q2229171) (← links)
- Collapsibility of non-cover complexes of graphs (Q2290346) (← links)
- Clique-factors in sparse pseudorandom graphs (Q2323252) (← links)
- The hypergraph assignment problem (Q2339846) (← links)
- Cooperative colorings and independent systems of representatives (Q2346466) (← links)
- Systems of distant representatives in Euclidean space (Q2347967) (← links)
- The feasible matching problem (Q2376094) (← links)
- Topological methods for the existence of a rainbow matching (Q2413401) (← links)
- Independent systems of representatives in weighted graphs (Q2460628) (← links)
- Hall ratio of the Mycielski graphs (Q2501574) (← links)
- A note on interconnecting matchings in graphs (Q2509302) (← links)
- Monochromatic components in edge-colored complete uniform hypergraphs (Q2509763) (← links)
- An extension of Hall's theorem for partitioned bipartite graphs (Q2630339) (← links)
- A geometric Hall-type theorem (Q2789848) (← links)
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes (Q2833255) (← links)
- Monochromatic components in edge-colored complete uniform hypergraphs (Q2857398) (← links)
