On complete subgraphs of \(r\)-chromatic graphs

DOI10.1016/0012-365X(75)90011-4zbMath0306.05121OpenAlexW2096875564WikidataQ106084745 ScholiaQ106084745MaRDI QIDQ1217812

Paul Erdős, Béla Bollobás, Endre Szemerédi

Publication date: 1975

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(75)90011-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Complete subgraphs in a multipartite graph, Independent transversals in bipartite correspondence-covers, Bounded transversals in multipartite graphs, The Density Turán Problem, Independent transversals in locally sparse graphs, Complete Subgraphs of r-partite Graphs, The number of copies of \(K_{2,t+1}\) in a graph, Independent transversals in \(r\)-partite graphs, On factors of independent transversals in \(k\)-partite graphs, An average degree condition for independent transversals, A General Framework for Hypergraph Coloring, Colorings, transversals, and local sparsity, Graphs of low average degree without independent transversals, Bounded size components -- partitions and transversals., Turán numbers and anti-Ramsey numbers for short cycles in complete \(3\)-partite graphs, Packing list‐colorings, New bounds for the Moser‐Tardos distribution, Problems and results in extremal combinatorics. I., A universal partition result for infinite homogeneous \(K_n\)-free and related graphs, Polynomial treewidth forces a large grid-like-minor, On the maximum number of cliques in a graph, Independent coverings and orthogonal colourings, On certain cycles in graphs, Balanced independent sets in graphs omitting large cliques, Finding independent transversals efficiently, The number of complete subgraphs of equi-partite graphs, On subgraphs of tripartite graphs, Asymptotically the list colouring constants are 1, A Density Turán Theorem

Cites Work

• Unnamed Item
• Three-graphs without two triples whose symmetric difference is contained in a third
• On some extremal problems in graph theory
• On some extremal problems on \(r\)-graphs
• On the Structure of Edge Graphs II
• On complete subgraphs of different orders
• On the Structure of Edge Graphs
• On a problem of K. Zarankiewicz