Publication:5724802
From MaRDI portal
zbMath0116.01202MaRDI QIDQ5724802
Publication date: 1962
05C30: Enumeration in graph theory
Related Items
Generalized Ramsey theory for graphs, A new generalization of the Erdős-Ko-Rado theorem, 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs, On the complexity of fixed parameter clique and dominating set, Cycles in graphs and functional inequalities, Supersaturated graphs and hypergraphs, On the maximum number of cliques in a graph, On the number of certain subgraphs contained in graphs with a given number of edges, The maximal number of induced complete bipartite graphs, The number of triangles in a \(K_ 4\)-free graph, Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey, On the number of subgraphs of prescribed type of graphs with a given number of edges, Extremals of functions on graphs with applications to graphs and hypergraphs, On the number of complete subgraphs contained in certain graphs, On finite Ramsey numbers, On the maximal number of certain subgraphs in \(K_ r\)-free graphs, The chromatic uniqueness of complete bipartite graphs, Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs, Two path extremal graphs and an application to a Ramsey-type problem, The maximum number of triangles in a \(K_4\)-free graph, On graphs in which any pair of colour classes but one induces a tree, On the structure and chromaticity of graphs in which any two colour classes induce a tree, Graph products and monochromatic multiplicities, The number of complete subgraphs of equi-partite graphs, The maximal number of induced \(r\)-partite subgraphs, A new Turán-type theorem for cliques in graphs, Large generalized books are \(p\)-good, Multiplicities of subgraphs, Bounds on graph eigenvalues. II, Triangles in space or building (and analyzing) castles in the air, Some corollaries of a theorem of Whitney on the chromatic polynomial
