Graph products and monochromatic multiplicities

DOI10.1007/BF01196136zbMath0886.05100MaRDI QIDQ1382400

Andrew G. Thomason

Publication date: 26 March 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Ramseymonochromatictwo-edge-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Generalized Ramsey theory (05C55)

Related Items (15)

On tripartite common graphs ⋮ Inducibility and universality for trees ⋮ Clique number of Xor products of Kneser graphs ⋮ On a conjecture of Erdős for multiplicities of cliques ⋮ Non-bipartite \(k\)-common graphs ⋮ Locally common graphs ⋮ Toward characterizing locally common graphs ⋮ Edges Not Covered by Monochromatic Bipartite Graph ⋮ Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ On the number of edges not covered by monochromatic copies of a fixed graph. ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Monochromatic triangles in three-coloured graphs ⋮ A note on the inducibility of 4-vertex graphs ⋮ On edges not in monochromatic copies of a fixed bipartite graph ⋮ Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• Cycles in graphs and functional inequalities
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• Multiplicities of subgraphs
• On Sets of Acquaintances and Strangers at any Party
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• Blue-Empty Chromatic Graphs
• On the Ramsey multiplicities of graphs—problems and recent results

This page was built for publication: Graph products and monochromatic multiplicities