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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
