Sur un Probleme D'Erdös Et Hajnal
From MaRDI portal
Publication:3318795
The author constructs two graphs -- one on 15 and one on 16 vertices -- neither containing a \(K_5\) subgraph, such that any 2-coloring of their edges yields a monochromatic triangle. For the entire collection see [Zbl 0513.00004].
Recommendations
Cited in
(9)- Three hundred million points suffice
- Mangoes and blueberries
- A counterexample to a conjecture of Erdős
- Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings
- A solution of an Erdős problem
- scientific article; zbMATH DE number 3931124 (Why is no real title available?)
- scientific article; zbMATH DE number 3335822 (Why is no real title available?)
- scientific article; zbMATH DE number 3335823 (Why is no real title available?)
- Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
This page was built for publication: Sur un Probleme D'Erdös Et Hajnal
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318795)