Small Ramsey numbers for books, wheels, and generalizations
This brief note gives several new upper and lower bounds on Ramsey numbers for books
and wheels, including tight lower bounds establishing the Ramsey numbers $ R (B_3, B_6) …
and wheels, including tight lower bounds establishing the Ramsey numbers $ R (B_3, B_6) …
Generalized Ramsey numbers via conflict-free hypergraph matchings
A Lane, N Morrison - arXiv preprint arXiv:2405.16653, 2024 - arxiv.org
Given graphs $ G, H $ and an integer $ q\ge 2$, the generalized Ramsey number, denoted
$ r (G, H, q) $, is the minimum number of colours needed to edge-colour $ G $ such that …
$ r (G, H, q) $, is the minimum number of colours needed to edge-colour $ G $ such that …
Coloring problems in graph theory: k-packings and (p, q)-colorings
CM McRoberts - 2024 - search.proquest.com
Coloring problems in graph theory: k-packings and (p, q)-colorings by Christian Marquise
McRoberts A dissertation submitted to t Page 1 Coloring problems in graph theory: k-packings …
McRoberts A dissertation submitted to t Page 1 Coloring problems in graph theory: k-packings …