Jump to content

Talk:Discrepancy of hypergraphs

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by Cewbot (talk | contribs) at 22:31, 31 January 2024 (Maintain {{WPBS}} and vital articles: 1 WikiProject template. Create {{WPBS}}. Keep majority rating "Start" in {{WPBS}}. Remove 1 same rating as {{WPBS}} in {{Maths rating}}. Remove 1 deprecated parameter: field.). The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This page cites Helm's result. Has anyone (including the person who added the reference) been able to follow the proof in that paper? If there is such a person, please drop me an e-mail. Boris Bukh (talk) 20:45, 17 November 2007 (UTC)[reply]

Discrepancy bounds on random hypergraphs

[edit]

Results of the form the discrepancy of a random -regular hypergraph is bounded by function almost surely as [or ] grows are notably absent in the Theorems section. On top of my head, I can think of work by Ezra & Lovett (2015), Bansal & Meka (2019) and the most recently the ICALP 2020 Best Student Paper by Potukchi. I just wondered whether the article deliberately focuses on deterministic results or whether randomness would be welcome as well.

Thanks for any feedback.

Off topic: It is kinda funny to see a 2007 (ancient) comment by Boris Bukh on this talk page right after entering his 2016 result on Beck–Fiala.^^

Best -- 95.90.240.238 (talk) 13:55, 20 September 2020 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Discrepancy_of_hypergraphs&oldid=1201556987"