On monochromatic configurations for finite colorings
From MaRDI portal
Publication:400412
DOI10.1016/J.DISC.2014.06.015zbMATH Open1298.05097OpenAlexW2022294776MaRDI QIDQ400412FDOQ400412
Yonggao Chen, Sukumar Das Adhikari
Publication date: 21 August 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.015
Recommendations
Cites Work
- Euclidean Ramsey theorems. I
- Title not available (Why is that?)
- On partitions of \(\mathbb E^n\)
- All trapezoids are Ramsey
- On a theorem of Graham
- Remarks on monochromatic configurations for finite colorings of the plane
- All Triangles are Ramsey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monochromatic configurations for finite colourings of the plane
- Monochromatic simplices of any volume
Cited In (11)
- Monochromatic configurations for finite colourings of the plane
- Monomial invariants applied to graph coloring
- Monochromatic simplices of any volume
- Coloring Ordered Sets to Avoid Monochromatic Maximal Chains
- Title not available (Why is that?)
- Monochromatic geometric \(k\)-factors in red-blue sets with white and Steiner points
- Monotonic stable solutions for minimum coloring games
- Title not available (Why is that?)
- Colourings with Bounded Monochromatic Components in Graphs of Given Circumference
- Title not available (Why is that?)
- On modular monochromatic colorings of graphs
This page was built for publication: On monochromatic configurations for finite colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q400412)
