On the maximum number of edges in a hypergraph with given matching number
From MaRDI portal
(Redirected from Publication:516783)
Abstract: The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max{�inom(3s+2,3), �inom(n,3) - �inom(n-s,3)} for all n,s, n >= 3s+2.
Recommendations
Cites work
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- scientific article; zbMATH DE number 863493 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- Exact solution of some Turán-type problems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Improved bounds for Erdős' matching conjecture
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- On Erdős' extremal problem on matchings in hypergraphs
- On maximal paths and circuits of graphs
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- The complete intersection theorem for systems of finite sets
- The size of a hypergraph and its matching number
Cited in
(69)- Unavoidable hypergraphs
- Rainbow matchings in properly-colored hypergraphs
- Vertex degree sums for matchings in 3-uniform hypergraphs
- Degree versions of the Erdős-Ko-Rado theorem and Erdős hypergraph matching conjecture
- Vertex degree sums for matchings in 3-uniform hypergraphs
- On non-trivial families without a perfect matching
- On the hypercompetition numbers of hypergraphs with maximum degree at most two
- A stability result on matchings in 3-uniform hypergraphs
- Degree versions of theorems on intersecting families via stability
- Structure of the largest subgraphs of \(G_{n , p}\) with a given matching number
- Large \(Y_{3,2}\)-tilings in 3-uniform hypergraphs
- Families with no matchings of size s
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Linear trees in uniform hypergraphs
- Proof of the Erdős matching conjecture in a new range
- On the random version of the Erdős matching conjecture
- A generalization of Erdős' matching conjecture
- Beyond the Erdős matching conjecture
- The Erdős matching conjecture and concentration inequalities
- Erdős matching conjecture for almost perfect matchings
- Size and structure of large \((s,t)\)-union intersecting families
- Stability results for vertex Turán problems in Kneser graphs
- Extremal hypergraphs for matching number and domination number
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
- Extremal G-free induced subgraphs of Kneser graphs
- The size of 3-uniform hypergraphs with given matching number and codegree
- Remarks on the Erdős matching conjecture for vector spaces
- Disjoint perfect matchings in 3‐uniform hypergraphs
- Anti-Ramsey Number of Matchings in 3-Uniform Hypergraphs
- A better bound on the size of rainbow matchings
- Lagrangian densities of enlargements of matchings in hypergraphs
- Families with restricted matching number and multiply covered shadows
- A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
- Old and new applications of Katona's circle
- Rainbow perfect matchings for 4-uniform hypergraphs
- Families of finite sets satisfying intersection restrictions
- The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
- On families with bounded matching number
- Rainbow matchings for 3-uniform hypergraphs
- Turán graphs with bounded matching number
- Some results around the Erdős matching conjecture
- On Erdős' extremal problem on matchings in hypergraphs
- A note on fractional covers of a graph
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products
- Large Yk,b ${Y}_{k,b}$‐tilings and Hamilton ℓ $\ell $‐cycles in k $k$‐uniform hypergraphs
- Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
- On the maximum size of subfamilies of labeled set with given matching number
- Mixed matchings in graphs
- On Turán problems with bounded matching number
- On the maximum number of edges in hypergraphs with fixed matching and clique number
- Turán numbers for disjoint paths
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- On maximal tail probability of sums of nonnegative, independent and identically distributed random variables
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
- A short proof of Erdős' conjecture for triple systems
- On Rainbow Matchings for Hypergraphs
- The maximum number of cliques in hypergraphs without large matchings
- Invitation to intersection problems for finite sets
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs
- On the size of the product of overlapping families
- Maximum size of a graph with given fractional matching number
- On the matching number of \(k\)-uniform connected hypergraphs with maximum degree
- On the rainbow matching conjecture for 3-uniform hypergraphs
- Rainbow version of the Erdős Matching Conjecture via concentration
- Turán numbers of sunflowers
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- On matchings in hypergraphs
- On the maximum number of edges in chordal graphs of bounded degree and matching number
- Resilient hypergraphs with fixed matching number
This page was built for publication: On the maximum number of edges in a hypergraph with given matching number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516783)
