Abstract
For a given hypergraph H = (V, E) consider the sum q(H) of 2^{−|e|} over e ∈ E. Consider the class of hypergraphs whose smallest edge is of size n and for which every 2-colouring has a monochromatic edge. Let q(n) be the smallest value of q(H) in this class. We provide a survey of the known bounds on q(n) and make some minor refinements.
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 callSimilar Papers
Disclaimer: 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.
