Pentagons vs. triangles
From MaRDI portal
Publication:941370
DOI10.1016/j.disc.2007.08.016zbMath1152.05034OpenAlexW1990386955MaRDI QIDQ941370
Publication date: 4 September 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.016
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Paths and cycles (05C38) Boundary value problems on graphs and networks for ordinary differential equations (34B45)
Related Items (73)
Paths of length three are \(K_{r+1}\)-Turán-good ⋮ The Maximum Number of Triangles in C2k+1-Free Graphs ⋮ Hypergraphs with No Cycle of a Given Length ⋮ Nearly-Regular Hypergraphs and Saturation of Berge Stars ⋮ Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Large hypergraphs without tight cycles ⋮ Degenerate Turán problems for hereditary properties ⋮ Some exact results for generalized Turán problems ⋮ Generalized rainbow Turán problems ⋮ Multicolor Turán numbers ⋮ Generalized Turán number for linear forests ⋮ On generalized Turán number of two disjoint cliques ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ The maximum number of paths of length four in a planar graph ⋮ Forbidding \(K_{2,t}\) traces in triple systems ⋮ Generalized planar Turán numbers ⋮ Generalized rainbow Turán numbers of odd cycles ⋮ 3-uniform hypergraphs without a cycle of length five ⋮ Planar polynomials and an extremal problem of Fischer and Matoušek ⋮ The maximum number of cliques in graphs without long cycles ⋮ On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) ⋮ Extremal problems of double stars ⋮ Generalized Turán results for intersecting cliques ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ The maximum number of paths of length three in a planar graph ⋮ On regular hypergraphs of high girth ⋮ On Two Problems in Ramsey--Turán Theory ⋮ A note on the maximum number of triangles in a \(C_5\)-free graph ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Hypergraphs with no cycle of length 4 ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ Every graph is eventually Turán-good ⋮ Book free 3-uniform hypergraphs ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ On the Number of Cycles in a Graph with Restricted Cycle Lengths ⋮ On \(3\)-uniform hypergraphs avoiding a cycle of length four ⋮ Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) ⋮ Local-vs-global combinatorics ⋮ Generalized Turán problems for even cycles ⋮ Extremal Results for Berge Hypergraphs ⋮ Triangles in graphs without bipartite suspensions ⋮ On Tight Cycles in Hypergraphs ⋮ Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs ⋮ 3-uniform hypergraphs avoiding a given odd cycle ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Maximising the number of cycles in graphs with forbidden subgraphs ⋮ Turán problems and shadows. I: Paths and cycles ⋮ Induced Turán Numbers ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ Turán numbers for Berge-hypergraphs and related extremal problems ⋮ Saturation of Berge hypergraphs ⋮ Some sharp results on the generalized Turán numbers ⋮ On Turán-good graphs ⋮ Cycles of given lengths in hypergraphs ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Generalized Turán number of even linear forests ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ 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 ⋮ Hypergraphs with no odd cycle of given length ⋮ Generalized outerplanar Turán number of short paths ⋮ The maximum number of stars in a graph without linear forest ⋮ Generalized Turán densities in the hypercube ⋮ Ramsey Numbers for Nontrivial Berge Cycles ⋮ Counting cliques in 1-planar graphs ⋮ The regularity method for graphs with few 4‐cycles
Cites Work
This page was built for publication: Pentagons vs. triangles
