Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
From MaRDI portal
(Redirected from Publication:6635102)
Recommendations
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Lagrangian densities of enlargements of matchings in hypergraphs
- A note on Lagrangians of 4-uniform hypergraphs.
- The Lagrangian density of the disjoint union of a 3-uniform tight path and a matching and the Turán number of its extension
- Lagrangian densities of linear forests and Turán numbers of their extensions
Cites work
- \(\lambda\)-perfect hypergraphs and Lagrangian densities of hypergraph cycles
- A hypergraph Turán theorem via Lagrangians of intersecting families
- A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians
- A unified approach to hypergraph stability
- An exact Turán result for the generalized triangle
- An irrational Lagrangian density of a single hypergraph
- An irrational Turán density via hypergraph Lagrangian densities
- Asymptotic solution for a new class of forbidden r-graphs
- Extremal problems whose solutions are the blowups of the small Witt- designs
- scientific article; zbMATH DE number 863493 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Hypergraphs do not jump
- Improved bounds for Erdős' matching conjecture
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Lagrangian densities of linear forests and Turán numbers of their extensions
- Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
- Lagrangian-perfect hypergraphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Maximal number of subsets of a finite set No k of which are pairwise disjoint
- New Turán densities for 3-graphs
- On Erdős' extremal problem on matchings in hypergraphs
- On maximal paths and circuits of graphs
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- On the maximum number of edges in a hypergraph with given matching number
- On the maximum number of edges in a triple system not containing a disjoint family of a given size
- On the structure of linear graphs
- Proof of the Erdős matching conjecture in a new range
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- Spectral extremal problems for hypergraphs
- Stability and Turán Numbers of a Class of Hypergraphs via Lagrangians
- The Erdős matching conjecture and concentration inequalities
- The size of a hypergraph and its matching number
- Turán number of generalized triangles
- Turán numbers of extensions
Cited in
(2)
This page was built for publication: Lagrangian densities of 4-uniform matchings and degree stability of extremal hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635102)
