Abstract
Abstract The work deals with a generalization of Erdős – Lovasz problem concerning colorings of non-uniform hypergraphs. Let H = ( V , E ) be a hypergraph and let f r ( H ) = ∑ e ∈ E r 1 − | e | for some r ⩾ 2 . Erdős and Lovasz asked about the value f ( n ) equal to the minimum possible value of f 2 ( H ) where H is 3-chromatic hypergraph with minimum edge-cardinality n. In our paper we study similar problem in the class of hypergraphs with large girth.
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.
