scientific article; zbMATH DE number 3258858
[For the entire collection see Zbl 0155.00201.] Die vorliegende Arbeit schließt sich an den von P. Turán stammenden Problemenkreis an: es wird die kleinste ganze Zahl \(f(n;G)\) gesucht derart, daß sämtliche \(n\) Punkte und \(f(n;G)\) Kanten besitzende Graphen den Graphen \(G\) als Teilgraphen enthalten; ferner wird nach der Struktur eines zu einem Graphen \(G\) gehörigen extremen Graphen gefragt, worunter man jene \(n\) Punkte und \(f(n;G)-1\) Kanten besitzenden Graphen versteht, die \(G\) nicht als Teilgraphen enthalten. Bekanntlich wurde dieses Problem von P. Turán für den Fall gelöst, daß \(G\) ein vollständiger \(r\)-Graph ist (bei beliebigem \(r\)); oder in anderer Fassung, daß \(G\) ein vollständiger \(r\)-Graph ist (bei beliebigem \(r\)); oder in anderer Fassung, daß \(G\) ein \(r\) Punkte besitzender \(r\)-chromatischer Graph \(K_r\) ist. Es ergab sich (mit der Bezeichnung \(K_r(p_1,...,p_r\)) für vollständige \(r\)-chromatische Graphen, wobei \(p_i\) Punkte die \(i\)-te Farbe besitzen, und je zwei verschieden gefärbte Punkte verbunden sind), daß die zu \(K_r=K_r(1,...,1)\) gehörigen extremen Graphen alle die Struktur \(K_{r-1}(p_1,...,p_{r-1})\) haben, wobei die Zahlen \(p_i\) so wenig wie möglich von einander abweichen. Das Hauptergebnis vorliegender Arbeit (Satz 3) legt dar, daß die zu \(G\) gehörigen extremen Graphen auch dann von ähnlicher Struktur sind (mit Abweichungen infolge der Abhängigkeit von \(n\)), wenn \(G\) bei beliebigem \(n\) ein \(n\) Punkte besitzender \(r\)-chromatischer Graph ist. Im Beweis wird eine auch an sich interessante untere Abschätzung des Graphen aller Punkte eines zu \(G\) gehörigen extremen Graphen benutzt. Mit Hilfe dieses Satzes wird eine, vom Verf. früher ohne Beweis mitgeteilte, obere Abschätzung von \(f(n;K_r(t,...,t))\) als ein Spezialfall eines in vorliegender Arbeit bewiesenen allgemeineren Satzes (Satz 1) bewiesen, der für ein 2-chromatisches \(G\) eine obere Abschätzung von \(f(n;\{G: K_{r-2}(t,...,t))\}\) angibt; wobei allgemein ein Graph \([G: K_s(p_1,...,p_s)]\) aus \(G\) durch Hinzunahme von \(K_s(p_1,...,p_s)\) nebst Verbindung aller neuen Punkte mit sämtlichen Punkten von \(G\) entsteht. Es werden auch einige Vermutungen mitgeteilt, außerdem eine --- vom Verf. durch komplizierte Methoden bewiesene --- Verschärfung von Satz 1 (ohne Beweis).
- Turán's theorem inverted
- Another extremal problem for Turan graphs
- On a Turán type problem of Erdős
- The extremal graph problem of the icosahedron
- Forbidding induced even cycles in a graph: typical structure and counting
- Star-critical Ramsey numbers for large generalized fans and books
- The number of graphs without forbidden subgraphs
- Some sharp results on the generalized Turán numbers
- Star-critical Ramsey numbers of generalized fans
- A note on stability for maximal \(F\)-free graphs
- Star-critical Ramsey numbers involving large books
- Ramsey numbers of fans and large books
- Extremal graphs of the \(p\)th power of paths
- Star-critical Ramsey numbers involving large generalized fans
- Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions
- Minimal Ramsey graphs on deleting stars for generalized fans and books
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- Turán number and decomposition number of intersecting odd cycles
- Extremal problems for directed graphs
- On a valence problem in extremal graph theory
- A hierarchy of randomness for graphs
- A hypergraph extension of Turán's theorem
- On the structure of linear graphs
- The chromatic profile of locally bipartite graphs
- Graphs with large maximum degree containing no edge-critical graphs
- On a conjecture of spectral extremal problems
- Extremal graph for intersecting odd cycles
- Ramsey numbers of a fixed odd-cycle and generalized books and fans
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- scientific article; zbMATH DE number 3970790 (Why is no real title available?)
- Some extremal problems for hereditary properties of graphs
- Minimum \(H\)-decompositions of graphs: edge-critical case
- scientific article; zbMATH DE number 1017094 (Why is no real title available?)
- An extension of Turán's theorem, uniqueness and stability
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- Hypergraph containers
- Local convergence and stability of tight bridge-addable classes
- Extremal theory of locally sparse multigraphs
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- On Some Applications of Graph Theory to Geometry
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- An extremal problem in graph theory
- scientific article; zbMATH DE number 3365308 (Why is no real title available?)
- An extremal graph problem
- scientific article; zbMATH DE number 3191789 (Why is no real title available?)
- scientific article; zbMATH DE number 4189765 (Why is no real title available?)
- scientific article; zbMATH DE number 3084814 (Why is no real title available?)
- Ramsey Numbers Involving Large Books
- The chromatic profile of locally colourable graphs
- Edge-decompositions of graphs with high minimum degree
- Tight bounds on the coefficients of partition functions via stability
- Minimum rainbow \(H\)-decompositions of graphs
- Measures on monotone properties of graphs
- Tight bounds on the coefficients of partition functions via stability
- On the density of a graph and its blowup
- Generalized Turán problems for double stars
- Generalized Turán results for intersecting cliques
- Large joints in graphs
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Ramsey non-goodness involving books
- Some exact results for non-degenerate generalized Turán problems
- Ramsey numbers of a wheel of order five versus fans
- 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
- Improving the Caro-Wei bound and applications to Turán stability
- Extremal graphs for the odd prism
- The Turán number of Berge book hypergraphs
- Star-critical Ramsey numbers involving large books
- 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
- On generalized Turán numbers of intersecting cliques
- On graphs for which large books are Ramsey good
- Ramsey goodness of large books revisited
- Excluding induced subgraphs. II: Extremal graphs
- On Turán-type problems and the abstract chromatic number
- Extremal graphs for disjoint union of vertex-critical graphs
- On forbidding graphs as traces of hypergraphs
- A sharp spectral extremal result for general non-bipartite graphs
- A stability theorem for multi-partite graphs
- Non-r-partite graphs without complete split subgraphs
- An improved result on the stability of odd cycles
- Ramsey numbers of small wheels versus fans
- Proof of a conjecture of Xiao and Zamora
- Fan-complete Ramsey numbers
- 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
- Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans
- On weakly Turán-good graphs
- Supersaturation beyond color-critical graphs
- Generalized Turán results for matchings
- A strong structural stability of \(C_{2 k + 1}\)-free graphs
- A stability theorem for maximal \(K_{r+1}\)-free graphs
- Non-bipartite graphs without theta subgraphs
- Number of copies of \(C_4\) guarantees strong structural stability of graphs forbidding \(C_{2k+1}\)
- Turán problem for Berge disjoint cycles in hypergraphs
- Turán number of books in non-bipartite graphs
- Some Turán-type results for the signless Laplacian spectral radius
- Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5544083)