Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
From MaRDI portal
Publication:2264683
DOI10.1016/0012-365X(74)90044-2zbMATH Open0274.05113OpenAlexW2065268498MaRDI QIDQ2264683FDOQ2264683
Authors: Miklós Simonovits
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
Cites Work
- Graph Theory and Probability
- On maximal paths and circuits of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- An extremal graph problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On chromatic number of finite set-systems
- On a theorem of Rademacher-Turán
- The extremal graph problem of the icosahedron
Cited In (50)
- A note on stability for maximal \(F\)-free graphs
- On the Chromatic Thresholds of Hypergraphs
- The extremal graph problem of the icosahedron
- Extremal graphs for blow-ups of stars and paths
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs
- Excluding induced subgraphs. II: Extremal graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- Maximising the number of cycles in graphs with forbidden subgraphs
- Extremal graphs for odd wheels
- The Turán number for the edge blow-up of trees
- Generalized Turán results for edge blow-up of star forests
- Generalized Turán problems for double stars
- Turán number for odd‐ballooning of trees
- On possible Turán densities
- Turán number of the odd-ballooning of complete bipartite graphs
- Strong Turán stability
- Extremal subgraphs of random graphs
- Strong Turán stability
- On the Turán number of edge blow-ups of cliques
- The fine structure of octahedron-free graphs
- The Turán number for the edge blow-up of trees: the missing case
- Extremal graphs of the \(p\)th power of paths
- On paul turán's influence on graph theory
- Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star
- Turán-type problems on \([a, b]\)-factors of graphs, and beyond
- On degree sums of a triangle-free graph
- Stability and exact Turán numbers for matroids
- The asymptotic number of graphs not containing a fixed color-critical subgraph
- Extremal graphs for blow-ups of keyrings
- The Turán number of the square of a path
- Extremal graphs for the odd prism
- On the Turán number of the hypercube
- Spectral extremal problem on disjoint color-critical graphs
- Spectral extremal problem on \(t\) copies of \(\ell\)-cycles
- On the typical structure of graphs not containing a fixed vertex-critical subgraph
- Extremal Graph Problems for Graphs with a Color-Critical Vertex
- On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
- Extremal graphs for odd-ballooning of paths and cycles
- Graphs with large maximum degree containing no edge-critical graphs
- The Turán number of Berge book hypergraphs
- Planar Turán numbers on short cycles of consecutive lengths
- The Turán number of the triangular pyramid of 3-layers
- Stability from graph symmetrization arguments in generalized Turán problems
- Extremal graphs for the suspension of edge-critical graphs
- Exact stability for Turán's theorem
- Stability results for graphs with a critical edge
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
- Extremal graphs for edge blow-up of graphs
- Extremal numbers for odd cycles
This page was built for publication: Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264683)