On the maximum number of edges in a hypergraph with given matching number
From MaRDI portal
Publication:516783
DOI10.1016/J.DAM.2016.08.003zbMath1358.05202arXiv1205.6847OpenAlexW1506116723MaRDI QIDQ516783
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.6847
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (59)
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 ⋮ A note on fractional covers of a graph ⋮ Turán numbers of sunflowers ⋮ Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture ⋮ Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions ⋮ The Erdős matching conjecture and concentration inequalities ⋮ Remarks on the Erdős matching conjecture for vector spaces ⋮ Disjoint perfect matchings in 3‐uniform hypergraphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Stability results for vertex Turán problems in Kneser graphs ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number ⋮ Proof of the Erdős matching conjecture in a new range ⋮ Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs ⋮ On maximal tail probability of sums of nonnegative, independent and identically distributed random variables ⋮ Turán numbers for disjoint paths ⋮ Extremal Problem for Matchings and Rainbow Matchings on Direct Products ⋮ On families with bounded matching number ⋮ Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs ⋮ Families with no matchings of size \(s\) ⋮ A better bound on the size of rainbow matchings ⋮ Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs ⋮ Erdős matching conjecture for almost perfect matchings ⋮ Families with restricted matching number and multiply covered shadows ⋮ On Rainbow Matchings for Hypergraphs ⋮ A short proof of Erdős' conjecture for triple systems ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ On Erdős' extremal problem on matchings in hypergraphs ⋮ On the random version of the Erdős matching conjecture ⋮ Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number ⋮ Rainbow matchings in properly-colored hypergraphs ⋮ Unavoidable hypergraphs ⋮ A generalization of Erdős' matching conjecture ⋮ On non-trivial families without a perfect matching ⋮ On the maximum size of subfamilies of labeled set with given matching number ⋮ Mixed matchings in graphs ⋮ Extremal \(G\)-free induced subgraphs of Kneser graphs ⋮ Linear trees in uniform hypergraphs ⋮ Beyond the Erdős matching conjecture ⋮ Old and new applications of Katona's circle ⋮ On the matching number of \(k\)-uniform connected hypergraphs with maximum degree ⋮ Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs ⋮ Rainbow matchings for 3-uniform hypergraphs ⋮ A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications ⋮ Some results around the Erdős matching conjecture ⋮ Invitation to intersection problems for finite sets ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ Families of finite sets satisfying intersection restrictions ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Degree versions of theorems on intersecting families via stability ⋮ Vertex degree sums for matchings in 3-uniform hypergraphs ⋮ On the size of the product of overlapping families ⋮ Turán problems for vertex-disjoint cliques in multi-partite hypergraphs ⋮ Maximum size of a graph with given fractional matching number ⋮ On the rainbow matching conjecture for 3-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- The complete intersection theorem for systems of finite sets
- Exact solution of some Turán-type problems
- On Erdős' extremal problem on matchings in 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
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
This page was built for publication: On the maximum number of edges in a hypergraph with given matching number
