Non-monochromatic triangles in a 2-edge-coloured graph
From MaRDI portal
Publication:2001990
zbMath1416.05103arXiv1809.10088MaRDI QIDQ2001990
Jessica McDonald, Amanda Montejano, Matt DeVos
Publication date: 11 July 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.10088
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
On a colored Turán problem of Diwan and Mubayi, Turán‐ and Ramsey‐type results for unavoidable subgraphs, Unavoidable chromatic patterns in 2‐colorings of the complete graph, Graphs without a Rainbow Path of Length 3
Cites Work