Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777081 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
We obtain sharper stability results for hypergraphs that avoid a copy of an expanded complete 2-graph and for hypergraphs that avoid a Fan subhypergraph. We apply this to an edge-coloring problem on uniform hypergraphs, where we wish to find an n-vertex hypergraph with the largest number of colorings avoiding a rainbow copy of a fixed hypergraph F.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann,