Pentagons vs. triangles
From MaRDI portal
In this paper two main results about graphs and hypergraphs with no cycle of length 5 are presented. The first one consists in a lower bound to the number of triangles in a graph that does not contain any cycle of length 5. The second result is an upper bound to \(| H|\), where \((V, H)\) is a 3-uniform hypergraph that does not contain any 5-cycle.
Recommendations
Cites work
Cited in
(97)- Dwarf, brick, and triangulation of the torus
- Supersaturation of C₄: from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Degenerate Turán problems for hereditary properties
- Pentagons in triangle-free graphs
- 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}\)
- A note on the maximum number of triangles in a C₅-free graph
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Cycles of given lengths in hypergraphs
- On the number of pentagons in triangle-free graphs
- 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
- Generalized Turán number of even linear forests
- Maximizing five-cycles in \(K_r\)-free graphs
- 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
- Counting cliques in 1-planar graphs
- Paths of length three are \(K_{r+1}\)-Turán-good
- 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
- 3-uniform hypergraphs without a cycle of length five
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- Generalized Turán problems for even cycles
- Maximising the number of cycles in graphs with forbidden subgraphs
- 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
- 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
- Turán problems for \(k\)-geodetic digraphs
- Triangles in graphs without bipartite suspensions
- Hypergraphs with no odd cycle of given length
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
- Hypergraphs with no cycle of a given length
- Triangle-Free Hypergraphs
- scientific article; zbMATH DE number 3966128 (Why is no real title available?)
- scientific article; zbMATH DE number 3979118 (Why is no real title available?)
- On regular hypergraphs of high girth
- Hypergraphs with no cycle of length 4
- 3-uniform hypergraphs avoiding a given odd cycle
- On the Number of Cycles in a Graph with Restricted Cycle Lengths
- On tight cycles in hypergraphs
- Induced Turán numbers
- Turán problems and shadows. I: Paths and cycles
- Cycles of length 5 in triangle-free graphs: a sporadic counterexample to a characterization of equality
- A note on the Turán number of a Berge odd cycle
- Ramsey numbers for nontrivial Berge cycles
- Large hypergraphs without tight cycles
- Lower bounds for rainbow Turan numbers of paths and other trees
- On 3-uniform hypergraphs without a cycle of a given length
- Many H-copies in graphs with a forbidden tree
- Nearly-regular hypergraphs and saturation of Berge stars
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- On two problems in Ramsey-Turán theory
- Extremal results for Berge hypergraphs
- The regularity method for graphs with few 4‐cycles
- Many \(T\) copies in \(H\)-free graphs
- Many \(T\) copies in \(H\)-free graphs
- 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
- Stability version of Dirac's theorem and its applications for generalized Turán problems
- Maximum cliques in a graph without disjoint given subgraph
- Every graph is eventually Turán-good
- Book free 3-uniform hypergraphs
- On \(3\)-uniform hypergraphs avoiding a cycle of length four
- Exact generalized Turán number for K₃ versus suspension of P₄
- Local-vs-global combinatorics
- Regular decomposition of the edge set of a graph with applications
- Exact results on generalized Erdős-Gallai problems
- Many triangles in \(C_5\)-free graphs
- On the generalized Turán problem for odd cycles
- A localized approach to generalized Turán problems
- Generalized Turán problems for even cycles
- On the maximum number of odd cycles in graphs without smaller odd cycles
- The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs
- On the Constructor-Blocker game
- Extremal number of cliques of given orders in graphs with a forbidden clique minor
- The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two
- Counting multiple graphs in generalized Turán problems
- The maximum number of short paths in a Halin graph
- Generalized Turán problems for small graphs
- Exact results for generalized extremal problems forbidding an even cycle
- The generalized Turán number for K₃ in graphs without suspensions of a path on five vertices
- Generalized planar Turán numbers related to short cycles
This page was built for publication: Pentagons vs. triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941370)
