Banff designs: difference methods for coloring incidence graphs
Combinatorics
2024-04-24 v2
Abstract
We present some results on the harmonious colorings of the Levi graph of a -design, focusing on Steiner -designs. It is easily seen that the harmonious chromatic number of such a Levi graph is at least the number of points of the design: we study and construct Banff designs, that is, designs such that this lower bound is attained.
Keywords
Cite
@article{arxiv.2312.05861,
title = {Banff designs: difference methods for coloring incidence graphs},
author = {Marco Buratti and Francesca Merola and Anamari Nakic and Christian Rubio-Montiel},
journal= {arXiv preprint arXiv:2312.05861},
year = {2024}
}