2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
From MaRDI portal
Publication:685676
DOI10.1016/0012-365X(93)90366-2zbMath0782.05059OpenAlexW2056469042MaRDI QIDQ685676
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
Related Items (18)
Inducibility and universality for trees ⋮ The step Sidorenko property and non-norming edge-transitive graphs ⋮ On a conjecture of Erdős for multiplicities of cliques ⋮ Non-bipartite \(k\)-common graphs ⋮ Multiplicities of subgraphs ⋮ Graph products and monochromatic multiplicities ⋮ Toward characterizing locally common graphs ⋮ The number of additive triples in subsets of abelian groups ⋮ On the Ramsey multiplicity of complete graphs ⋮ Two-colorings with many monochromatic cliques in both colors ⋮ On the number of monotone sequences ⋮ A note on the inducibility of 4-vertex graphs ⋮ Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs ⋮ On the densities of cliques and independent sets in graphs ⋮ On the Profile of Multiplicities of Complete Subgraphs ⋮ Graphs with Few 3‐Cliques and 3‐Anticliques are 3‐Universal ⋮ Triply Existentially Complete Triangle‐Free Graphs ⋮ On the 3‐Local Profiles of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs
- 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
This page was built for publication: 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
