Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions

From MaRDI portal
Revision as of 09:05, 2 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2264683

DOI10.1016/0012-365X(74)90044-2zbMath0274.05113OpenAlexW2065268498MaRDI QIDQ2264683

Miklós Simmonovits

Publication date: 1974

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90044-2




Related Items (39)

Extremal graphs for blow-ups of stars and pathsThe Turán number of the triangular pyramid of 3-layersExtremal graphs of the \(p\)th power of pathsExtremal Graph Problems for Graphs with a Color-Critical VertexExtremal graphs for blow-ups of keyringsStability and exact Turán numbers for matroidsStability results for graphs with a critical edgeExtremal graphs for odd-ballooning of paths and cyclesExtremal graphs for edge blow-up of graphsGraphs with large maximum degree containing no edge-critical graphsGeneralized Turán problems for double starsThe extremal graph problem of the icosahedronExtremal graphs for odd wheelsTurán number of the family consisting of a blow-up of a cycle and a blow-up of a starA stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphsTurán number for odd‐ballooning of treesCounterexamples to Gerbner's conjecture on stability of maximal F‐free graphsThe fine structure of octahedron-free graphsOn the Turán number of the hypercubeSpectral extremal problem on disjoint color-critical graphsExtremal Numbers for Odd CyclesOn the Chromatic Thresholds of HypergraphsThe Turán number for the edge blow-up of trees: the missing caseStrong Turán stabilityOn degree sums of a triangle-free graphOn possible Turán densitiesMaximising the number of cycles in graphs with forbidden subgraphsEmbedding Graphs into Larger Graphs: Results, Methods, and ProblemsThe Turán number for the edge blow-up of treesMinimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphsStrong Turán stabilityExcluding induced subgraphs. II: Extremal graphsThe asymptotic number of graphs not containing a fixed color-critical subgraphExtremal subgraphs of random graphsOn paul turán's influence on graph theoryA note on stability for maximal \(F\)-free graphsThe Turán number of the square of a pathPlanar Turán numbers on short cycles of consecutive lengthsExact stability for Turán’s Theorem



Cites Work


This page was built for publication: Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions