On the maximum number of five-cycles in a triangle-free graph
From MaRDI portal
Publication:713972
DOI10.1016/j.jctb.2012.04.001zbMath1252.05093arXiv1102.0962OpenAlexW2073268088MaRDI QIDQ713972
Publication date: 19 October 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.0962
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Asymptotic enumeration (05A16) Model theory of finite structures (03C13) Density (toughness, etc.) (05C42)
Related Items (64)
Paths of length three are \(K_{r+1}\)-Turán-good ⋮ Finitely forcible graph limits are universal ⋮ Some exact results for generalized Turán problems ⋮ Generalized rainbow Turán problems ⋮ Multicolor Turán numbers ⋮ Generalized Turán number for linear forests ⋮ Rainbow triangles in three-colored graphs ⋮ The maximum number of paths of length four in a planar graph ⋮ Pentagons in triangle-free graphs ⋮ Generalized planar Turán numbers ⋮ Planar polynomials and an extremal problem of Fischer and Matoušek ⋮ The maximum number of cliques in graphs without long cycles ⋮ On supersaturation and stability for generalized Turán problems ⋮ Generalized Turán results for intersecting cliques ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ 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 ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ The cycle of length four is strictly \(F\)-Turán-good ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Lower Bounds for Maximum Weighted Cut ⋮ Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ Turán problems for \(k\)-geodetic digraphs ⋮ On the Number of Cycles in a Graph with Restricted Cycle Lengths ⋮ Generalized Turán problems for even cycles ⋮ Minimum Number of Monotone Subsequences of Length 4 in Permutations ⋮ Subgraph densities in \(K_r\)-free graphs ⋮ Triangles in graphs without bipartite suspensions ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Strong forms of stability from flag algebra calculations ⋮ Maximising the number of cycles in graphs with forbidden subgraphs ⋮ Finitely forcible graphons and permutons ⋮ \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ On 3-uniform hypergraphs without a cycle of a given length ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ The Inducibility of Graphs on Four Vertices ⋮ Counting flags in triangle-free digraphs ⋮ A New Bound for the 2/3 Conjecture ⋮ Some sharp results on the generalized Turán numbers ⋮ On the inducibility of cycles ⋮ On Turán-good graphs ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Generalized Turán number of even linear forests ⋮ The shifting method and generalized Turán number of matchings ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ A problem of Erdős on the minimum number of \(k\)-cliques ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ More about sparse halves in triangle-free graphs ⋮ Minimum number of edges that occur in odd cycles ⋮ Weak regularity and finitely forcible graph limits ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths ⋮ Generalized Turán densities in the hypercube ⋮ Counting cliques in 1-planar graphs ⋮ On the algebraic and topological structure of the set of Turán densities
Cites Work
This page was built for publication: On the maximum number of five-cycles in a triangle-free graph
