2-colorings of complete graphs with a small number of monochromatic K_ 4 subgraphs

DOI10.1016/0012-365X(93)90366-2zbMATH Open0782.05059OpenAlexW2056469042MaRDI QIDQ685676FDOQ685676

Authors: Vojtěch Rödl, Frantisek Franek 

Publication date: 24 October 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90366-2

Recommendations

• A Disproof of a Conjecture of Erdős in Ramsey Theory
• On a conjecture of Erdős for multiplicities of cliques
• Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
• A problem of Erdős on the minimum number of \(k\)-cliques
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6

zbMATH Keywords

Cayley graphscliquesErdős conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Title not available (Why is that?)
• A Constructive Solution to a Tournament Problem
• Title not available (Why is that?)
• On Sets of Acquaintances and Strangers at any Party
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
• The number of submatrices of a given type in a Hadamard matrix and related results
• On Subgraphs of the Complete Bipartite Graph

Cited In (18)

• The step Sidorenko property and non-norming edge-transitive graphs
• On the 3-local profiles of graphs
• On the Ramsey multiplicity of complete graphs
• On the profile of multiplicities of complete subgraphs
• Two-colorings with many monochromatic cliques in both colors
• Non-bipartite \(k\)-common graphs
• Toward characterizing locally common graphs
• Triply existentially complete triangle-free graphs
• Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
• On the densities of cliques and independent sets in graphs
• Graph products and monochromatic multiplicities
• Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal
• Multiplicities of subgraphs
• On the number of monotone sequences
• A note on the inducibility of 4-vertex graphs
• The number of additive triples in subsets of abelian groups
• Inducibility and universality for trees
• On a conjecture of Erdős for multiplicities of cliques

This page was built for publication: 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs

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