Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs

DOI10.1007/BF02351585zbMath0772.05070OpenAlexW1980501966MaRDI QIDQ1205339

Vojtěch Rödl, Frantisek Franek

Publication date: 1 April 1993

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02351585

zbMATH Keywords

multiplicitiescliquessmall perturbationRamsey's theoremRamsey problempseudorandom graphconjecture of Erdősnearly quasirandom graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Related Items (6)

The step Sidorenko property and non-norming edge-transitive graphs ⋮ On a conjecture of Erdős for multiplicities of cliques ⋮ An approximate version of Sidorenko's conjecture ⋮ Locally common graphs ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• On universality of graphs with uniformly distributed edges
• The number of submatrices of a given type in a Hadamard matrix and related results
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• On Sets of Acquaintances and Strangers at any Party
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A Constructive Solution to a Tournament Problem
• On Subgraphs of the Complete Bipartite Graph
• Quasi-random graphs

This page was built for publication: Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs