On complete subgraphs of different orders

DOI10.1017/S0305004100052063MaRDI QIDQ4088852zbMATH OpenOpenAlexWikidataFDO

Authors Béla Bollobás

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites work

• The Representation of a Graph by Set Intersections
• Three-graphs without two triples whose symmetric difference is contained in a third
• Triangles in an Ordinary Graph

Cited in

(53)

• On the number of edge disjoint cliques in graphs of given size
• A note on induced cycles in Kneser graphs
• On complete subgraphs of r-chromatic graphs
• Turán function and H-decomposition problem for gem graphs
• Some extremal results on complete degenerate hypergraphs
• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
• Covers in hypergraphs
• Covering by intersecting families
• Decomposing uniform hypergraphs into uniform hypertrees and single edges
• Unified approach to the generalized Turán problem and supersaturation
• The feasible region of induced graphs
• Supersaturation for subgraph counts
• Generalized rainbow Turán problems
• 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
• Counting copies of a fixed subgraph in F-free graphs
• Minimum \(H\)-decompositions of graphs
• Turán number and decomposition number of intersecting odd cycles
• Complete subgraphs in connected graphs and its application to spectral moment
• Generalized rainbow Turán numbers of odd cycles
• Triangles in graphs without bipartite suspensions
• Constructing designs straightforwardly: Worst arising cases
• Cliques in graphs with bounded minimum degree
• Cliques in graphs with bounded minimum degree
• The number of cliques in graphs of given order and size
• Monochromatic clique decompositions of graphs
• The Chromatic Number of Kneser Hypergraphs
• Minimum \(H\)-decompositions of graphs: edge-critical case
• Decomposition of graphs into (k,r)-fans and single edges
• Problems and invariants connected with bicliques and multicliques of graphs
• On the density of triangles and squares in regular finite and unimodular random graphs
• The exact minimum number of triangles in graphs with given order and size
• Asymptotic Structure for the Clique Density Theorem
• Many H-copies in graphs with a forbidden tree
• Books versus triangles at the extremal density
• Decompositions of graphs into fans and single edges
• Asymptotic structure of graphs with the minimum number of triangles
• Monochromatic \(K_{r}\)-decompositions of graphs
• Many \(T\) copies in \(H\)-free graphs
• Minimum rainbow \(H\)-decompositions of graphs
• Minimum rainbow \(H\)-decompositions of graphs
• Many \(T\) copies in \(H\)-free graphs
• On supersaturation and stability for generalized Turán problems
• Large joints in graphs
• Stability from graph symmetrisation arguments with applications to inducibility
• Every graph is eventually Turán-good
• Maximising the number of properly 2-coloured 4-cycles
• Extremal number of cliques of given orders in graphs with a forbidden clique minor
• A note on extremal constructions for the Erdős-Rademacher problem
• Counting multiple graphs in generalized Turán problems
• An improved error term for minimum H-decompositions of graphs
• Supersaturated graphs and hypergraphs
• Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices

This page was built for publication: On complete subgraphs of different orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4088852)