Abstract
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
Highlights
The structure of edge-colored complete graphs containing no rainbow triangle is well understood through the following fundamental result.Theorem 1 ([1, 7, 10])
We improve upon existing lower bounds for non-bipartite graphs H to a value that we conjecture to be sharp up to a constant multiple
In any colored complete graph containing no rainbow triangle, there exists a partition of the vertices such that there are at most two colors on the edges between the parts and only one color on edges between each pair of parts
Summary
Follow this and additional works at: https://digitalcommons.georgiasouthern.edu/tag Part of the Discrete Mathematics and Combinatorics Commons. Colton (2018) "A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs," Theory and Applications of Graphs: Vol 5 : Iss. 1 , Article 4.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
