Abstract
AbstractLet the random variable count the number of edges of a hypergraph induced by a random m element subset B of its vertex set. Focussing on the case that satisfies some regularity condition we prove bounds on the probability that X is far from its mean. It is possible to apply these results to discrete structures such as the set of k‐term arithmetic progressions in the cyclic group . Furthermore, we show that our main theorem is essentially best possible and we deduce results for the case is generated by including each vertex independently with probability p.
Sign-in/Register to access full text options 
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.
