The Size of a Hypergraph and its Matching Number
From MaRDI portal
Publication:2888870
DOI10.1017/S096354831100068XzbMath1242.05268arXiv1107.5544OpenAlexW2083155064MaRDI QIDQ2888870
Po-Shen Loh, Hao Huang, Benjamin Sudakov
Publication date: 4 June 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5544
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)
Related Items (67)
Rainbow version of the Erdős Matching Conjecture via concentration ⋮ A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs ⋮ Size and structure of large \((s,t)\)-union intersecting families ⋮ Perfect Matchings in Hypergraphs and the Erdös Matching Conjecture ⋮ Möbius-Walsh correlation bounds and an estimate of Mauduit and Rivat ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ On the sum of sizes of overlapping families ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Improved bounds for Erdős' matching conjecture ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Unnamed Item ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number ⋮ On vertex independence number of uniform hypergraphs ⋮ Proof of the Erdős matching conjecture in a new range ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ Co-degree threshold for rainbow perfect matchings in uniform hypergraphs ⋮ Rainbow spanning structures in graph and hypergraph systems ⋮ Hypercontractivity for global functions and sharp thresholds ⋮ Turán numbers for disjoint paths ⋮ How many colors guarantee a rainbow matching? ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ 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 ⋮ Spectral radius and rainbow matchings of graphs ⋮ A better bound on the size of rainbow matchings ⋮ Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ Intersection theorems for multisets ⋮ Some new results on Gallai theorem and perfect matching for \(k\)-uniform hypergraphs ⋮ Erdős matching conjecture for almost perfect matchings ⋮ Families with restricted matching number and multiply covered shadows ⋮ A proof of Frankl's conjecture on cross-union families ⋮ Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels ⋮ On Rainbow Matchings for Hypergraphs ⋮ A Rainbow r-Partite Version of the Erdős–Ko–Rado Theorem ⋮ Hypergraph Turán numbers of linear cycles ⋮ The structure of large intersecting families ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ On Erdős' extremal problem on matchings in hypergraphs ⋮ The size of 3-uniform hypergraphs with given matching number and codegree ⋮ On the random version of the Erdős matching conjecture ⋮ Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number ⋮ On the size of shadow-added intersecting families ⋮ Rainbow matchings in properly-colored hypergraphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Tight cycles and regular slices in dense hypergraphs ⋮ On the maximum number of edges in a hypergraph with given matching number ⋮ A generalization of Erdős' matching conjecture ⋮ The minimum number of disjoint pairs in set systems and related problems ⋮ On non-trivial families without a perfect matching ⋮ Unnamed Item ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ On the maximum size of subfamilies of labeled set with given matching number ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ Linear trees in uniform hypergraphs ⋮ Beyond the Erdős matching conjecture ⋮ Simple juntas for shifted families ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ Invitation to intersection problems for finite sets ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ On the union of intersecting families ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Rainbow matchings in k‐partite hypergraphs ⋮ On the size of the product of overlapping families ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs ⋮ On the bandwidth of the Kneser graph
Cites Work
- On maximal paths and circuits of graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- On a conjecture of milner on k-graphs with non-disjoint edges
- On a Chebyshev-Type Inequality for Sums of Independent Random Variables
- A new generalization of the Erdős-Ko-Rado theorem
This page was built for publication: The Size of a Hypergraph and its Matching Number
