Cycles of given lengths in hypergraphs
From MaRDI portal
Publication:1791703
DOI10.1016/J.JCTB.2018.04.004zbMath1397.05049arXiv1609.08212OpenAlexW2964134489WikidataQ129187189 ScholiaQ129187189MaRDI QIDQ1791703
Publication date: 11 October 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.08212
Related Items (14)
Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Large hypergraphs without tight cycles ⋮ Hypergraphs with no tight cycles ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Linear cycles of consecutive lengths ⋮ Exact bipartite Turán numbers of large even cycles ⋮ Bipartite-ness under smooth conditions ⋮ Book free 3-uniform hypergraphs ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ On Tight Cycles in Hypergraphs ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Asymptotics for the Turán number of Berge-\(K_{2,t}\) ⋮ Berge cycles in non-uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 3-uniform hypergraphs avoiding a given odd cycle
- Turán problems and shadows. I: Paths and cycles
- The extremal function for cycles of length \(\ell\) mod \(k\)
- On 3-uniform hypergraphs without a cycle of a given length
- Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs
- Cycles with consecutive odd lengths
- Pentagons vs. triangles
- Cycle lengths in sparse graphs
- On a class of degenerate extremal graph problems
- \(C_ 6\)-free bipartite graphs and product representation of squares
- Cycle lengths and minimum degree of graphs
- Cycles in triangle-free graphs of large chromatic number
- Cycles of even length in graphs
- Distribution of cycle lengths in graphs
- On product representation of powers. I
- Hypergraph Turán numbers of linear cycles
- On Arithmetic Progressions of Cycle Lengths in Graphs
- A note on the Turán function of even cycles
- Hypergraphs with No Cycle of a Given Length
- Extremal problems for cycles in graphs
- On maximal paths and circuits of graphs
- Triangle-Free Hypergraphs
- Rainbow Turán Problems
- Graph decomposition with applications to subdivisions and path systems modulo k
- Intersection Properties of Systems of Finite Sets
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers
- Cycles in bipartite graphs and an application in number theory
- A Bound on the Number of Edges in Graphs Without an Even Cycle
- On coloring graphs to maximize the proportion of multicolored k-edges
- A Note on Bipartite Graphs Without 2 k -Cycles
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Cycles of given lengths in hypergraphs
