Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
From MaRDI portal
Publication:2264683
Cites work
- An extremal graph problem
- Graph Theory and Probability
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- scientific article; zbMATH DE number 3258858 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- scientific article; zbMATH DE number 3298603 (Why is no real title available?)
- On a theorem of Rademacher-Turán
- On chromatic number of finite set-systems
- On maximal paths and circuits of graphs
- The extremal graph problem of the icosahedron
Cited in
(75)- The asymptotic number of graphs not containing a fixed color-critical subgraph
- The extremal graph problem of the icosahedron
- Stability results for graphs with a critical edge
- Minimizing the number of edges in \(\mathcal{C}_{\geq r} \)-saturated graphs
- A note on stability for maximal \(F\)-free graphs
- The Turán number of the square of a path
- Planar Turán numbers on short cycles of consecutive lengths
- The Turán number of the triangular pyramid of 3-layers
- Extremal graphs of the \(p\)th power of paths
- Stability and exact Turán numbers for matroids
- Extremal graphs for odd-ballooning of paths and cycles
- Maximising the number of cycles in graphs with forbidden subgraphs
- The Turán number for the edge blow-up of trees
- Extremal graphs for blow-ups of keyrings
- Extremal graphs for edge blow-up of graphs
- Graphs with large maximum degree containing no edge-critical graphs
- The Turán number for the edge blow-up of trees: the missing case
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On paul turán's influence on graph theory
- Extremal Graph Problems for Graphs with a Color-Critical Vertex
- On degree sums of a triangle-free graph
- On possible Turán densities
- Extremal subgraphs of random graphs
- Exact stability for Turán's theorem
- Extremal numbers for odd cycles
- On the Chromatic Thresholds of Hypergraphs
- Strong Turán stability
- Strong Turán stability
- Generalized Turán problems for double stars
- Extremal graphs for odd wheels
- Turán number of the family consisting of a blow-up of a cycle and a blow-up of a star
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Turán number for odd‐ballooning of trees
- Counterexamples to Gerbner's conjecture on stability of maximal F‐free graphs
- On the Turán number of the hypercube
- Spectral extremal problem on disjoint color-critical graphs
- The fine structure of octahedron-free graphs
- Generalized Turán results for edge blow-up of star forests
- Turán number of the odd-ballooning of complete bipartite graphs
- On the Turán number of edge blow-ups of cliques
- Turán-type problems on \([a, b]\)-factors of graphs, and beyond
- Extremal graphs for the odd prism
- Spectral extremal problem on t copies of -cycles
- On the typical structure of graphs not containing a fixed vertex-critical subgraph
- The Turán number of Berge book hypergraphs
- On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph
- Stability from graph symmetrization arguments in generalized Turán problems
- Extremal graphs for the suspension of edge-critical graphs
- Spectral extremal problem of the p th power of cycles
- Generalized Turán number for edge blow-up of paths and cycles
- A spectral stability result regarding the complete bipartite graph \(K_{2,t}\)
- Note on two Kirchhoff index Turán problems
- On graphs without cycles of length 0 modulo 4
- Excluding induced subgraphs. II: Extremal graphs
- On Turán-type problems and the abstract chromatic number
- On forbidding graphs as traces of hypergraphs
- An improved result on the stability of odd cycles
- Spectral extremal results on edge blow-up of graphs
- The signless Laplacian spectral Turán problems for color-critical graphs
- Spectral extremal problem for the odd prism
- Extremal number of graphs from geometric shapes
- The exact Turán number of disjoint graphs -- a generalization of Simonovits' theorem, and beyond
- Stability in Bondy's theorem on paths and cycles
- Decomposition family and spectral extremal problems on non-bipartite graphs
- Tight bound on the minimum degree to guarantee graphs forbidding some odd cycles to be bipartite
- On weakly Turán-good graphs
- Turán numbers for vertex-disjoint triangles and pentagons
- Extremal number of graphs from geometric shapes (extended abstract)
- Supersaturation beyond color-critical graphs
- The minimum spectral radius of tP₃- or K₅-saturated graphs via the number of 2-walks
- Generalized Turán results for matchings
- Spectral skeletons and applications
- Turán problem for Berge disjoint cycles in hypergraphs
- Turán number of books in non-bipartite graphs
- Extremal graphs for blow-ups of stars and paths
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)