Some stability results for linear forests in hypergraphs
From MaRDI portal
Cites work
- 3-uniform hypergraphs avoiding a given odd cycle
- A hypergraph extension of Turán's theorem
- An Erdős-Gallai type theorem for uniform hypergraphs
- Asymptotics for the Turán number of Berge-\(K_{2,t}\)
- Exact computation of the hypergraph Turán function for expanded complete 2-graphs
- Exact solution of the hypergraph Turán problem for k-uniform linear paths
- Extremal results for Berge hypergraphs
- General lemmas for Berge-Turán hypergraph problems
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3221072 (Why is no real title available?)
- Hypergraph extensions of the Erdős-Gallai theorem
- Hypergraph Turán numbers of linear cycles
- Hypergraphs with no cycle of a given length
- Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
- Linear trees in uniform hypergraphs
- On Erdős' extremal problem on matchings in hypergraphs
- On matchings in hypergraphs
- On maximal paths and circuits of graphs
- On the maximum number of edges in a hypergraph with given matching number
- SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
- The Erdős matching conjecture and concentration inequalities
- The formula for Turán number of spanning linear forests
- The Turán number for spanning linear forests
- The Turán number of Berge hypergraphs with stable properties
- The Turán number of Berge-matching in hypergraphs
- Triangle-Free Hypergraphs
- Turán numbers for forests of paths in hypergraphs
- Turán numbers for hypergraph star forests
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
This page was built for publication: Some stability results for linear forests in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883680)
