Sur un Probleme D'Erdös Et Hajnal

DOI10.1016/S0304-0208(08)73402-9zbMATH Open0535.05028OpenAlexW33842431MaRDI QIDQ3318795FDOQ3318795

Authors: Guy R. Giraud 

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73402-9

Recommendations

• Three hundred million points suffice
• scientific article; zbMATH DE number 970798
• Remarks on 15-vertex (3,3)-Ramsey graphs not containing K_5
• scientific article; zbMATH DE number 4177114
• NOTES ON SOME ERDŐS–HAJNAL PROBLEMS

zbMATH Keywords

edge-coloring2-coloringmonochromatic triangle

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (8)

• Title not available (Why is that?)
• A counterexample to a conjecture of Erdős
• Three hundred million points suffice
• A solution of an Erdős problem
• Remarques sur deux problèmes extrémaux. (Remarks on two extremal problems)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on Gy. Elekes's conjectures concerning unavoidable patterns in proper colorings

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)