Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle

DOI10.1016/j.ejc.2015.08.006zbMath1327.05171arXiv1411.4645OpenAlexW2130182662MaRDI QIDQ896063

Florian Pfender, József Balogh, Bernard Lidický, Ping Hu

Publication date: 11 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.4645

zbMATH Keywords

density maximization

Mathematics Subject Classification ID

Paths and cycles (05C38) Density (toughness, etc.) (05C42)

Related Items (29)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ A bound on the inducibility of cycles ⋮ On the inducibility of oriented graphs on four vertices ⋮ Maximum number of almost similar triangles in the plane ⋮ Maximising the number of induced cycles in a graph ⋮ Rainbow triangles in three-colored graphs ⋮ C5 ${C}_{5}$ is almost a fractalizer ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ The maximum number of induced C5's in a planar graph ⋮ On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices ⋮ On the exact maximum induced density of almost all graphs and their inducibility ⋮ Stability from graph symmetrisation arguments with applications to inducibility ⋮ Further results on the inducibility of $d$-ary trees ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ Finitely forcible graphons with an almost arbitrary structure ⋮ Strong forms of stability from flag algebra calculations ⋮ Semidefinite Programming and Ramsey Numbers ⋮ On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament ⋮ On the inducibility of cycles ⋮ On the inducibility of cycles ⋮ The edge-statistics conjecture for \(\ell \ll k^{6/5} \) ⋮ Inducibility of \(d\)-ary trees ⋮ Anticoncentration for subgraph statistics ⋮ Decomposing Graphs into Edges and Triangles ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ Closing in on Hill's Conjecture ⋮ Edge-statistics on large graphs ⋮ Compactness and finite forcibility of graphons ⋮ Inducibility of directed paths

Uses Software

• SageMath
• Flagmatic

Cites Work

• A problem of Erdős and Sós on 3-graphs
• A new lower bound based on Gromov's method of selecting heavily covered points
• Turán \(H\)-densities for 3-graphs
• The inducibility of blow-up graphs
• Monochromatic triangles in three-coloured graphs
• On possible Turán densities
• On the maximum number of five-cycles in a triangle-free graph
• A problem of Erdős on the minimum number of \(k\)-cliques
• The inducibility of graphs
• On the number of pentagons in triangle-free graphs
• Rainbow triangles in three-colored graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs
• A Solution to the 2/3 Conjecture
• On the Minimal Density of Triangles in Graphs
• On the Maximum Induced Density of Directed Stars and Related Problems
• Minimum Number of Monotone Subsequences of Length 4 in Permutations
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• The Inducibility of Graphs on Four Vertices
• Flag algebras
• Counting flags in triangle-free digraphs

This page was built for publication: Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle