scientific article; zbMATH DE number 3185004

zbMath0114.01206MaRDI QIDQ5721211

John W. Moon

Publication date: 1962

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

combinatorics

Related Items (29)

Cliques and the spectral radius ⋮ The clique density theorem ⋮ The number of triangles in a \(K_ 4\)-free graph ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ Large joints in graphs ⋮ Color the cycles ⋮ On extremal graphs containing no wheels ⋮ Turán‐ and Ramsey‐type results for unavoidable subgraphs ⋮ On the average size of independent sets in triangle-free graphs ⋮ The minimum number of triangles in graphs of given order and size ⋮ THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE ⋮ Asymptotic Structure of Graphs with the Minimum Number of Triangles ⋮ Minimum number of affine simplices of given dimension ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On Perfect Matchings and Tilings in Uniform Hypergraphs ⋮ Joints in graphs ⋮ On the Hamiltonicity of triple systems with high minimum degree ⋮ Directed triangles in directed graphs ⋮ The maximum number of q-cliques in a graph with no p-clique ⋮ Supersaturation problem for the bowtie ⋮ On the triangle clique cover and \(K_t\) clique cover problems ⋮ A note on Turán's theorem ⋮ Ordered and colored subgraph density problems ⋮ Asymptotic Structure for the Clique Density Theorem ⋮ Minimizing the number of 5-cycles in graphs with given edge-density ⋮ A generalization of a theorem of Turán ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Supersaturation for subgraph counts

This page was built for publication: