Abstract
For k-uniform hypergraphs F and H and an integer r 2, let cr;F (H) denote the number of r-colorings of the set of hyperedges of H with no monochromatic copy of F and let cr;F (n) = maxH2Hn cr;F (H), where the maximum runs over the familyHn of all k-uniform hypergraphs on n vertices. Moreover, let ex(n;F ) be the usual Tur an function , i.e., the maximum number of hyperedges of an n-vertex k-uniform hypergraph which contains no copy of F . In this paper, we consider the question for determining cr;F (n) for arbitrary xed hypergraphs F and show
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.
