Hypergraphs with no cycle of a given length

DOI10.1017/S0963548311000691MaRDI QIDQ2883862zbMATH OpenOpenAlexFDO

Authors Nathan Lemons, Ervin Győri

Publication date 14 May 2012

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548311000691

zbMATH Keywords

3-uniform hypergraphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• Hypergraphs with no odd cycle of given length
• 3-uniform hypergraphs avoiding a given odd cycle
• On 3-uniform hypergraphs without a cycle of a given length
• 3-uniform hypergraphs without a cycle of length five
• Avoiding long Berge cycles: the missing cases k=r+1 and k=r+2

Cites work

• Cycles of even length in graphs
• Even cycles in hypergraphs
• Odd cycles and \(\Theta\)-cycles in hypergraphs
• On maximal paths and circuits of graphs
• Pentagons vs. triangles
• Triangle-Free Hypergraphs

Cited in

(55)

• On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\)
• Cycles of given lengths in hypergraphs
• On the cover Turán number of Berge hypergraphs
• The structure of hypergraphs without long Berge cycles
• On Hamiltonian Berge cycles in [3]-uniform hypergraphs
• Relative Turán numbers for hypergraph cycles
• Hypergraph based Berge hypergraphs
• Generalized Turán problems for complete bipartite graphs
• Multicolor Ramsey numbers for Berge cycles
• Turán numbers for hypergraph star forests
• The Turán number of Berge-matching in hypergraphs
• Generalized rainbow Turán problems
• Multicolor Turán numbers
• A note on the uniformity threshold for Berge hypergraphs
• 3-uniform hypergraphs without a cycle of length five
• On Berge-Ramsey problems
• Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
• Generalized Turán problems for even cycles
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Counting copies of a fixed subgraph in F-free graphs
• Generalized Turán problems for disjoint copies of graphs
• On the weight of Berge-\(F\)-free hypergraphs
• Turán numbers of complete 3-uniform Berge-hypergraphs
• Linearity of saturation for Berge hypergraphs
• Odd cycles and \(\Theta\)-cycles in hypergraphs
• Forbidding \(K_{2,t}\) traces in triple systems
• Hypergraphs with no odd cycle of given length
• 3-uniform hypergraphs avoiding a given odd cycle
• On tight cycles in hypergraphs
• Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
• Turán problems and shadows. I: Paths and cycles
• A note on the Turán number of a Berge odd cycle
• Large hypergraphs without tight cycles
• Hypergraphs with no tight cycles
• no-homomorphism conditions for hypergraphs
• \(t\)-wise Berge and \(t\)-heavy hypergraphs
• On 3-uniform hypergraphs without a cycle of a given length
• Anti-Ramsey numbers of paths and cycles in hypergraphs
• Ramsey problems for Berge hypergraphs
• Extremal results for Berge hypergraphs
• Counting hypergraphs with large girth
• Induced Turán problems and traces of hypergraphs
• Improved lower bounds for multiplicative square-free sequences
• On \(3\)-uniform hypergraphs avoiding a cycle of length four
• On Ramsey numbers of 3-uniform Berge cycles
• A stability result for Berge-\( K_{3 , t}r\)-graphs and its applications
• The Turán number of Berge book hypergraphs
• A note on stability results for Berge-\( K_{s , t}\) hypergraphs
• The Turán number of Berge-linear forests in hypergraphs
• Some stability results for linear forests in hypergraphs
• The maximum Wiener index of a uniform hypergraph
• Berge pancyclic hypergraphs
• Turán problem for Berge disjoint cycles in hypergraphs
• Avoiding range via Turán-type bounds
• On the cover Ramsey number of Berge hypergraphs

This page was built for publication: Hypergraphs with no cycle of a given length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883862)