Triangles in C5‐free graphs and hypergraphs of girth six
From MaRDI portal
Publication:6056790
DOI10.1002/jgt.22723zbMath1525.05137arXiv1811.11873OpenAlexW3186567577MaRDI QIDQ6056790
Abhishek Methuku, Beka Ergemlidze
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.11873
Related Items
Maximum cliques in a graph without disjoint given subgraph, Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\), Generalized Turán densities in the hypercube
Cites Work
- Unnamed Item
- On 3-uniform hypergraphs without a cycle of a given length
- Pentagons vs. triangles
- On hypergraphs of girth five
- Compactness results in extremal graph theory
- Some sharp results on the generalized Turán numbers
- Generalized Turán problems for even cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- A note on the maximum number of triangles in a C5‐free graph
- Induced Turán Numbers
- A Generalized Turán Problem and its Applications
- A generalized Turán problem in random graphs
- Many H-Copies in Graphs with a Forbidden Tree
- Turán Number of an Induced Complete Bipartite Graph Plus an Odd Cycle
- Many \(T\) copies in \(H\)-free graphs
