Improved bound on vertex degree version of Erdős matching conjecture
From MaRDI portal
Publication:6081573
DOI10.1002/jgt.22974zbMath1522.05376arXiv2001.02820WikidataQ123210921 ScholiaQ123210921MaRDI QIDQ6081573
Mingyang Guo, Yao-Lin Jiang, Hongliang Lu
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.02820
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs
- Perfect matchings in 4-uniform hypergraphs
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Near perfect coverings in graphs and hypergraphs
- Matchings in 3-uniform hypergraphs
- The Erdős matching conjecture and concentration inequalities
- Degree versions of theorems on intersecting families via stability
- Exact minimum degree thresholds for perfect matchings in uniform hypergraphs. II
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- Fractional and integer matchings in uniform hypergraphs
- Perfect Matchings in 3-Uniform Hypergraphs with Large Vertex Degree
- The Size of a Hypergraph and its Matching Number
- On maximal paths and circuits of graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Nearly Perfect Matchings in Uniform Hypergraphs
This page was built for publication: Improved bound on vertex degree version of Erdős matching conjecture
