Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture

DOI10.1016/j.jcta.2017.03.006zbMath1362.05091arXiv1605.07535OpenAlexW2602080697WikidataQ123014074 ScholiaQ123014074MaRDI QIDQ2397107

Yi Zhao, Hao Huang

Publication date: 29 May 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.07535

zbMATH Keywords

algebraic methodhypergraph matchingdegree version

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (13)

Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition ⋮ The spectral radii of intersecting uniform hypergraphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ A degree version of the Hilton-Milner theorem ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ A note on Huang-Zhao theorem on intersecting families with large minimum degree ⋮ Matching in 3-uniform hypergraphs ⋮ Minimum degree and diversity in intersecting antichains ⋮ Degree versions of theorems on intersecting families via stability ⋮ Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree ⋮ On the Erdos-Ko-Rado property of finite groups of order a product of three primes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• On matchings in hypergraphs
• A note on Huang-Zhao theorem on intersecting families with large minimum degree
• On the maximum number of edges in a hypergraph with given matching number
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Matchings in 3-uniform hypergraphs
• On Erdős' extremal problem on matchings in hypergraphs
• Fractional and integer matchings in uniform hypergraphs
• Co-degree density of hypergraphs
• On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
• The Size of a Hypergraph and its Matching Number
• Recent advances on Dirac-type problems for hypergraphs
• Erdös–Ko–Rado Theorem—22 Years Later
• On maximal paths and circuits of graphs
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• A new generalization of the Erdős-Ko-Rado theorem

This page was built for publication: Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture