Pages that link to "Item:Q713972"
From MaRDI portal
The following pages link to On the maximum number of five-cycles in a triangle-free graph (Q713972):
Displaying 50 items.
- On the algebraic and topological structure of the set of Turán densities (Q256996) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- On the Caccetta-Häggkvist conjecture with a forbidden transitive tournament (Q528999) (← links)
- A problem of Erdős on the minimum number of \(k\)-cliques (Q744160) (← links)
- Inducibility of directed paths (Q785814) (← links)
- Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle (Q896063) (← links)
- Finitely forcible graph limits are universal (Q1621473) (← links)
- Pentagons in triangle-free graphs (Q1671749) (← links)
- Planar polynomials and an extremal problem of Fischer and Matoušek (Q1682210) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- Strong forms of stability from flag algebra calculations (Q1719577) (← links)
- \(H\)-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups (Q1727770) (← links)
- Maximum density of vertex-induced perfect cycles and paths in the hypercube (Q1981712) (← links)
- Some sharp results on the generalized Turán numbers (Q2011146) (← links)
- On Turán-good graphs (Q2032868) (← links)
- Generalized Turán number of even linear forests (Q2042218) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Generalized Turán densities in the hypercube (Q2099479) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- Some exact results for generalized Turán problems (Q2136200) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Generalized Turán number for linear forests (Q2144592) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Maximising the number of cycles in graphs with forbidden subgraphs (Q2222049) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- The shifting method and generalized Turán number of matchings (Q2297913) (← links)
- Minimum number of edges that occur in odd cycles (Q2312602) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- Compactness and finite forcibility of graphons (Q2327712) (← links)
- Rainbow triangles in three-colored graphs (Q2399351) (← links)
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube (Q2509737) (← links)
- The maximum number of paths of length four in a planar graph (Q2659227) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- Turán problems for \(k\)-geodetic digraphs (Q2689115) (← links)
- Subgraph densities in \(K_r\)-free graphs (Q2699640) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- More about sparse halves in triangle-free graphs (Q3391027) (← links)
- Weak regularity and finitely forcible graph limits (Q4608759) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- The Inducibility of Graphs on Four Vertices (Q5417819) (← links)
- On supersaturation and stability for generalized Turán problems (Q6055938) (← links)
- Generalized Turán results for intersecting cliques (Q6056423) (← links)
- The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
- On the maximum number of odd cycles in graphs without smaller odd cycles (Q6056808) (← links)
- The maximum number of paths of length three in a planar graph (Q6057639) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
