Large monochromatic components in 3‐edge‐colored Steiner triple systems
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Combinatorial Designs"
DOI: 10.1002/jcd.21707
Abstract: It is known that in any r‐coloring of the edges of a complete r‐uniform hypergraph, there exists a spanning monochromatic component. Given a Steiner triple system on n vertices, what is the largest monochromatic component… read more here.
Keywords: lower bound; coloring edges; triple systems; steiner triple ... See more keywords