Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
From MaRDI portal
Publication:423641
DOI10.1016/j.jcta.2012.02.004zbMath1242.05189arXiv1107.1219OpenAlexW2127902766WikidataQ105583655 ScholiaQ105583655MaRDI QIDQ423641
Andrzej Ruciński, Hao Huang, Vojtěch Rödl, Noga Alon, Peter Frankl, Benjamin Sudakov
Publication date: 4 June 2012
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1219
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)
Related Items (65)
A note on exact minimum degree threshold for fractional perfect matchings ⋮ Rainbow version of the Erdős Matching Conjecture via concentration ⋮ Matching of Given Sizes in Hypergraphs ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Dirac-type theorems in random hypergraphs ⋮ Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Fractional and integer matchings in uniform hypergraphs ⋮ Near Perfect Matchings in ${k}$-Uniform Hypergraphs II ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Vertex degree sums for perfect matchings in 3-uniform hypergraphs ⋮ Improved bounds for Erdős' matching conjecture ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ On vertex independence number of uniform hypergraphs ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Packing \(k\)-partite \(k\)-uniform hypergraphs ⋮ On maximal tail probability of sums of nonnegative, independent and identically distributed random variables ⋮ Improved bound on vertex degree version of Erdős matching conjecture ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Perfect matchings in 3-partite 3-uniform hypergraphs ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ A better bound on the size of rainbow matchings ⋮ Perfect matchings in 4-uniform hypergraphs ⋮ Nonnegative \(k\)-sums, fractional covers, and probability of small deviations ⋮ Minimum degree conditions for tight Hamilton cycles ⋮ Erdős matching conjecture for almost perfect matchings ⋮ How to Poison Your Mother-in-Law, and Other Caching Problems ⋮ On Rainbow Matchings for Hypergraphs ⋮ Near Perfect Matchings ink-Uniform Hypergraphs ⋮ A note on perfect matchings in uniform hypergraphs ⋮ Unnamed Item ⋮ Minimum Codegree Threshold forC63-Factors in 3-Uniform Hypergraphs ⋮ Exact minimum degree thresholds for perfect matchings in uniform hypergraphs ⋮ An application of the universality theorem for Tverberg partitions to data depth and hitting convex sets ⋮ Decision problem for perfect matchings in dense 𝑘-uniform hypergraphs ⋮ On a connection of two graph-theoretic problems with conjectures of Ramanujan and Samuels ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Polynomial-time perfect matchings in dense hypergraphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs ⋮ A generalization of Erdős' matching conjecture ⋮ Matching in 3-uniform hypergraphs ⋮ Forbidding Hamilton cycles in uniform hypergraphs ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ Tight minimum degree conditions forcing perfect matchings in uniform hypergraphs ⋮ Unnamed Item ⋮ The complexity of perfect matchings and packings in dense hypergraphs ⋮ Near-perfect clique-factors in sparse pseudorandom graphs ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ A geometric theory for hypergraph matching ⋮ Degree versions of theorems on intersecting families via stability ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ Maximum size of a graph with given fractional matching number ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs ⋮ On the \(A_\alpha\)-spectral radius of graphs without large matchings ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ A linear bound on the Manickam-Miklós-Singhi conjecture ⋮ Minimum Vertex Degree Threshold for ‐tiling* ⋮ Minimum vertex degree threshold for loose Hamilton cycles in 3-uniform hypergraphs ⋮ Fractional matchings in hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonnegative \(k\)-sums, fractional covers, and probability of small deviations
- Perfect matchings (and Hamilton cycles) in hypergraphs with large degrees
- Perfect matchings in uniform hypergraphs with large minimum degree
- Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Near perfect coverings in graphs and hypergraphs
- Matchings in 3-uniform 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
- On maximal paths and circuits of graphs
- On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
- Embedding large subgraphs into dense graphs
- Degrees giving independent edges in a hypergraph
- Optimal File Sharing in Distributed Networks
- Distributed Storage Allocations
- On a Chebyshev-Type Inequality for Sums of Independent Random Variables
- Some Theorems on Abstract Graphs
This page was built for publication: Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
