Linear trees in uniform hypergraphs

DOI10.1016/J.EJC.2013.06.022zbMath1296.05140arXiv1204.1936OpenAlexW1964094911MaRDI QIDQ2509754

Zoltan Fueredi

Publication date: 29 July 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.1936

zbMATH Keywords

delta-system method\(k\)-uniform linear hypergraph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (15)

Turán numbers for hypergraph star forests ⋮ Turán problems and shadows. II: Trees ⋮ On vertex independence number of uniform hypergraphs ⋮ Turán numbers of Berge trees ⋮ Hypergraph Turán numbers of linear cycles ⋮ The structure of large intersecting families ⋮ Extremal Results for Berge Hypergraphs ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Non-trivial \(d\)-wise intersecting families ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Decomposing uniform hypergraphs into uniform hypertrees and single edges ⋮ Asymptotic Turán number for linear 5-cycle in 3-uniform linear hypergraphs ⋮ Turán Problems and Shadows III: Expansions of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• On matchings in hypergraphs
• On the maximum number of edges in a hypergraph with given matching number
• Unavoidable subhypergraphs: \(\mathbf a\)-clusters
• On finite set-systems whose every intersection is a kernel of a star
• Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• On a packing and covering problem
• Forbidding just one intersection
• The maximum number of edges in a 3-graph not containing a given star
• Exact solution of some Turán-type problems
• Exact computation of the hypergraph Turán function for expanded complete 2-graphs
• Minimal paths and cycles in set systems
• On Erdős' extremal problem on matchings in hypergraphs
• A hypergraph extension of Turán's theorem
• Hypergraph Extensions of the Erdős-Gallai Theorem
• 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
• Maximal circuits of graphs. I
• On families of finite sets no two of which intersect in a singleton
• Intersection Properties of Systems of Finite Sets
• Hamiltonian chains in hypergraphs
• Set Systems with No Singleton Intersection

This page was built for publication: Linear trees in uniform hypergraphs