{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.08462"}],"scopus_import":"1","quality_controlled":"1","title":"Hypergraph cuts above the average","issue":"1","oa_version":"Preprint","intvolume":"       233","language":[{"iso":"eng"}],"year":"2019","publisher":"Springer","article_type":"original","day":"01","date_published":"2019-08-01T00:00:00Z","_id":"9580","doi":"10.1007/s11856-019-1897-z","author":[{"first_name":"David","full_name":"Conlon, David","last_name":"Conlon"},{"last_name":"Fox","first_name":"Jacob","full_name":"Fox, Jacob"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"}],"publication":"Israel Journal of Mathematics","publication_status":"published","abstract":[{"text":"An r-cut of a k-uniform hypergraph H is a partition of the vertex set of H into r parts and the size of the cut is the number of edges which have a vertex in each part. A classical result of Edwards says that every m-edge graph has a 2-cut of size m/2+Ω)(m−−√) and this is best possible. That is, there exist cuts which exceed the expected size of a random cut by some multiple of the standard deviation. We study analogues of this and related results in hypergraphs. First, we observe that similarly to graphs, every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m−−√) larger than the expected size of a random r-cut. Moreover, in the case where k = 3 and r = 2 this bound is best possible and is attained by Steiner triple systems. Surprisingly, for all other cases (that is, if k ≥ 4 or r ≥ 3), we show that every m-edge k-uniform hypergraph has an r-cut whose size is Ω(m5/9) larger than the expected size of a random r-cut. This is a significant difference in behaviour, since the amount by which the size of the largest cut exceeds the expected size of a random cut is now considerably larger than the standard deviation.","lang":"eng"}],"date_updated":"2023-02-23T14:01:41Z","volume":233,"extern":"1","type":"journal_article","publication_identifier":{"issn":["0021-2172"],"eissn":["1565-8511"]},"status":"public","page":"67-111","external_id":{"arxiv":["1803.08462"]},"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","oa":1,"article_processing_charge":"No","citation":{"ieee":"D. Conlon, J. Fox, M. A. Kwan, and B. Sudakov, “Hypergraph cuts above the average,” <i>Israel Journal of Mathematics</i>, vol. 233, no. 1. Springer, pp. 67–111, 2019.","short":"D. Conlon, J. Fox, M.A. Kwan, B. Sudakov, Israel Journal of Mathematics 233 (2019) 67–111.","ama":"Conlon D, Fox J, Kwan MA, Sudakov B. Hypergraph cuts above the average. <i>Israel Journal of Mathematics</i>. 2019;233(1):67-111. doi:<a href=\"https://doi.org/10.1007/s11856-019-1897-z\">10.1007/s11856-019-1897-z</a>","mla":"Conlon, David, et al. “Hypergraph Cuts above the Average.” <i>Israel Journal of Mathematics</i>, vol. 233, no. 1, Springer, 2019, pp. 67–111, doi:<a href=\"https://doi.org/10.1007/s11856-019-1897-z\">10.1007/s11856-019-1897-z</a>.","apa":"Conlon, D., Fox, J., Kwan, M. A., &#38; Sudakov, B. (2019). Hypergraph cuts above the average. <i>Israel Journal of Mathematics</i>. Springer. <a href=\"https://doi.org/10.1007/s11856-019-1897-z\">https://doi.org/10.1007/s11856-019-1897-z</a>","chicago":"Conlon, David, Jacob Fox, Matthew Alan Kwan, and Benny Sudakov. “Hypergraph Cuts above the Average.” <i>Israel Journal of Mathematics</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s11856-019-1897-z\">https://doi.org/10.1007/s11856-019-1897-z</a>.","ista":"Conlon D, Fox J, Kwan MA, Sudakov B. 2019. Hypergraph cuts above the average. Israel Journal of Mathematics. 233(1), 67–111."},"month":"08","date_created":"2021-06-21T13:36:02Z"}