On complete subgraphs of different orders
From MaRDI portal
Publication:4088852
DOI10.1017/S0305004100052063zbMath0325.05117OpenAlexW2019480324WikidataQ97694676 ScholiaQ97694676MaRDI QIDQ4088852
Publication date: 1976
Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0305004100052063
Related Items
Cliques in Graphs With Bounded Minimum Degree, Covering by intersecting families, Unnamed Item, Generalized rainbow Turán problems, Minimum \(H\)-decompositions of graphs, Turán function and \(H\)-decomposition problem for gem graphs, Monochromatic Clique Decompositions of Graphs, Unnamed Item, Complete subgraphs in connected graphs and its application to spectral moment, Generalized rainbow Turán numbers of odd cycles, Large joints in graphs, Turán number and decomposition number of intersecting odd cycles, Some extremal results on complete degenerate hypergraphs, On supersaturation and stability for generalized Turán problems, Stability from graph symmetrisation arguments with applications to inducibility, THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE, Minimum \(H\)-decompositions of graphs: edge-critical case, Every graph is eventually Turán-good, Decomposition of Graphs into (k,r)‐Fans and Single Edges, Asymptotic Structure of Graphs with the Minimum Number of Triangles, Triangles in graphs without bipartite suspensions, Many \(T\) copies in \(H\)-free graphs, Maximising the number of cycles in graphs with forbidden subgraphs, Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph, On the number of edge disjoint cliques in graphs of given size, A note on induced cycles in Kneser graphs, On the density of triangles and squares in regular finite and unimodular random graphs, \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges, Monochromatic Kr‐Decompositions of Graphs, On complete subgraphs of \(r\)-chromatic graphs, The Chromatic Number of Kneser Hypergraphs, Minimum rainbow \(H\)-decompositions of graphs, Minimum rainbow \(H\)-decompositions of graphs, Decomposing uniform hypergraphs into uniform hypertrees and single edges, Many H-Copies in Graphs with a Forbidden Tree, Many \(T\) copies in \(H\)-free graphs, An improved error term for minimum \(H\)-decompositions of graphs, Books versus Triangles at the Extremal Density, The number of cliques in graphs of given order and size, Asymptotic Structure for the Clique Density Theorem, Unified approach to the generalized Turán problem and supersaturation, Counting copies of a fixed subgraph in \(F\)-free graphs, Covers in hypergraphs, Supersaturated graphs and hypergraphs, Cliques in graphs with bounded minimum degree, The feasible region of induced graphs, Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices, Decompositions of Graphs into Fans and Single Edges, Supersaturation for subgraph counts
Cites Work
