Matchings in 3-uniform hypergraphs
From MaRDI portal
Publication:1945999
DOI10.1016/j.jctb.2012.11.005zbMath1262.05128arXiv1009.1298MaRDI QIDQ1945999
Andrew Treglown, Deryk Osthus, Daniela Kühn
Publication date: 17 April 2013
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.1298
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
d-matching in k-uniform hypergraphs, On Perfect Matchings and Tilings in Uniform Hypergraphs, Nearly Perfect Matchings in Uniform Hypergraphs, Triangle-degrees in graphs and tetrahedron coverings in 3-graphs, Matching of Given Sizes in Hypergraphs, A Stability Result on Matchings in 3-Uniform Hypergraphs, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, Rainbow Perfect Matchings for 4-Uniform Hypergraphs, Minimum Vertex Degree Threshold for ‐tiling*, Near Perfect Matchings ink-Uniform Hypergraphs, Perfect Packings in Quasirandom Hypergraphs II, Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs, Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs, A geometric theory for hypergraph matching, Perfect packings in quasirandom hypergraphs. I., On vertex independence number of uniform hypergraphs, Perfect matchings in 3-partite 3-uniform hypergraphs, Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels, Exact minimum degree thresholds for perfect matchings in uniform hypergraphs, Polynomial-time perfect matchings in dense hypergraphs, Note on matchings in 3-partite 3-uniform hypergraphs, Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs, On the Hamiltonicity of triple systems with high minimum degree, Dirac-type conditions for Hamiltonian paths and cycles in 3-uniform hypergraphs, Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees, Packing \(k\)-partite \(k\)-uniform hypergraphs, Perfect matchings in 4-uniform hypergraphs, A note on perfect matchings in uniform hypergraphs, Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs, Vertex degree sums for perfect matchings in 3-uniform hypergraphs, \(d\)-matching in 3-uniform hypergraphs, Matching in 3-uniform hypergraphs, Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs, Rainbow matchings for 3-uniform hypergraphs, Stability on matchings in 3-uniform hypergraphs, The Erdős matching conjecture and concentration inequalities, The complexity of perfect matchings and packings in dense hypergraphs, Vertex degree sums for matchings in 3-uniform hypergraphs, \(F\)-factors in hypergraphs via absorption, Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs, Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture, Families of triples with high minimum degree are Hamiltonian, Fractional and integer matchings in uniform hypergraphs, Unnamed Item, Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs, Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture, Near Perfect Matchings in ${k}$-Uniform Hypergraphs II, Embedding Graphs into Larger Graphs: Results, Methods, and Problems
