scientific article; zbMATH DE number 970802
From MaRDI portal
Publication:5689007
zbMath0863.05045MaRDI QIDQ5689007
Publication date: 11 March 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Biographies, obituaries, personalia, bibliographies (01A70) Enumeration in graph theory (05C30) Paths and cycles (05C38) History of combinatorics (05-03) Extremal combinatorics (05Dxx)
Related Items
A stability result for girth‐regular graphs with even girth ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ Turán‐type problems for long cycles in random and pseudo‐random graphs ⋮ Generalized Turán problems for even cycles ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite ⋮ On monomial graphs of girth eight ⋮ The number of maximal cliques and spectral radius of graphs with certain forbidden subgraphs ⋮ Paul Erdős, 1913-1996 ⋮ A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs ⋮ On the maximum number of cliques in a graph ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ The number of graphs without forbidden subgraphs ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ A hierarchy of randomness for graphs ⋮ Almost-spanning subgraphs with bounded degree in dense graphs
