On Gallai-ramsey Numbers of Complete Bipartite Graphs
Download or Read eBook On Gallai-ramsey Numbers of Complete Bipartite Graphs PDF written by Seth Gutierrez and published by . This book was released on 2017 with total page 27 pages. Available in PDF, EPUB and Kindle.
| Author | : Seth Gutierrez |
| Publisher | : |
| Total Pages | : 27 |
| Release | : 2017 |
| ISBN-10 | : OCLC:1001342318 |
| ISBN-13 | : |
| Rating | : 4/5 (18 Downloads) |
Book Synopsis On Gallai-ramsey Numbers of Complete Bipartite Graphs by : Seth Gutierrez
Book excerpt: Author's abstract: We show the minimum number of vertices necessary of a complete Gallai-colored graph on $k$ colors that forces a monochromatic complete bipartite graph $K_{2,m}$, $K_{3,3}$, and $K_{3,m}$, for $m\geq 3$. We also provide some results on graphs that are free of rainbow triangles with a pendant edge that provide more insight to the structure of Gallai colorings.
