Hypergraph cuts above the average

@article{Conlon2018HypergraphCA,
title={Hypergraph cuts above the average},
author={D. Conlon and J. Fox and Matthew Kwan and B. Sudakov},
journal={arXiv: Combinatorics},
year={2018}
}
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 + \Omega(\sqrt{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… Expand
7 Citations

Figures from this paper

Maximum bisections of graphs without short even cycles
• Mathematics, Computer Science
• J. Comb. Theory, Ser. A
• 2021
It is proved that if G also contains no cycle of length 2 k ≥ 6 then G either has a large bisection or is nearly bipartite. Expand
New results for MaxCut in $H$-free graphs
• Mathematics
• 2021
The MaxCut problem asks for the size mc(G) of a largest cut in a graph G. It is well known that mc(G) ≥ m/2 for any m-edge graph G, and the difference mc(G) −m/2 is called the surplus of G. The studyExpand
Dense Induced Bipartite Subgraphs in Triangle-Free Graphs
• Mathematics, Computer Science
• Comb.
• 2020
It is proved that any H -free graph with minimum degree at least d contains an induced bipartite subgraph of minimum degreeAt least c H log d /log log d , thus nearly confirming one and proving another conjecture of Esperet, Kang and Thomassé. Expand
Lower Bounds for Max-Cut in $H$-Free Graphs via Semidefinite Programming
• Computer Science, Mathematics
• 2018
This paper proposes an approach, based on semidefinite programming (SDP), to prove lower bounds on f, the size of the maximum cut in a graph, and uses this approach to find large cuts in graphs with few triangles and in $K_r$-free graphs. Expand
Probabilistic Reasoning in Combinatorics
This thesis explores a number of different aspects of the role that probability plays in combinatorics, and proves an old conjecture of Erdős, Faudree and Sós, and a more recent conjecture of Narayanan, Sahasrabudhe and Tomon regarding the structure of Ramsey graphs. Expand
Kalai's conjecture in $r$-partite $r$-graphs
Kalai conjectured that every $n$-vertex $r$-uniform hypergraph with more than $\frac{t-1}{r} {n \choose r-1}$ edges contains all tight $r$-trees of some fixed size $t$. We prove Kalai's conjectureExpand
Lower Bounds for Max-Cut via Semidefinite Programming
• Mathematics, Computer Science
• LATIN
• 2020

References

SHOWING 1-10 OF 38 REFERENCES
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting
• Mathematics, Computer Science
• LATIN
• 2012
It is shown that for every "partition connected" r-hypergraph, namely, Above Averager-Set Splitting (AA-r-SS), there always exists a 2-coloring of V(H) with {1,−1} such that the number of hyperedges is at least μH + {n-1}/{r2{r-1}}. Expand
Maximum cuts and judicious partitions in graphs without short cycles
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 2003
It is shown that every graph G with m edges has a bipartite subgraph with at least /m2; + c(r)mr/r+1 edges, and the order of the error term is shown to be optimal for r = 5 thus settling a special case of a conjecture of Erdos. Expand
MaxCut in ${\bm H)$-Free Graphs
• Mathematics
• Combinatorics, Probability and Computing
• 2005
For a graph G, let f(G) denote the maximum number of edges in a cut of G. For an integer m and for a fixed graph H, let $f(m,H)$ denote the minimum possible cardinality of $f(G)$, as G ranges overExpand
MaxCut in H-Free Graphs
• Mathematics
• 2005
For a graph G, let f(G) denote the maximum number of edges in a cut of G. For an integer m and for a fixed graph H, let f(m,H) denote the minimum possible cardinality of f(G), as G ranges over allExpand
Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
• Mathematics, Computer Science
• Random Struct. Algorithms
• 2012
We show that for every cubic graph Gwith sufficiently large girth there exists a probability distribution on edge-cuts in Gsuch that each edge is in a randomly chosen cut with probability at leastExpand
Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles
• Mathematics
• 2016
A subgraph of an edge-coloured complete graph is called rainbow if all its edges have different colours. In 1980 Hahn conjectured that every properly edge-coloured complete graph Kn has a rainbowExpand
Problems and Results in Graph Theory and Combinatorial Analysis
I published several papers with similar titles. One of my latest ones [13] (also see [16] and the yearly meetings at Boca Raton or Baton Rouge) contains, in the introduction, many references to myExpand
Bipartite subgraphs of integer weighted graphs
• Computer Science, Mathematics
• Discret. Math.
• 1998
This supplies the precise value of f(p) for many values of p including, e.g., all p = (2n) + (2m) when n is large enough and 1 4 m 2 ⩽ 1 2 n. Expand
Judicious partitions and related problems
• A. Scott
• Computer Science
• Surveys in Combinatorics
• 2005
In this survey, recent extremal results on a variety of questions concerning judicious partitions, and related problems such as Max Cut are discussed. Expand
Bipartite subgraphs
AbstractIt is shown that there exists a positivec so that for any large integerm, any graph with 2m2edges contains a bipartite subgraph with at least $$m^2 + m/2 + c\sqrt m$$ edges. This is tight upExpand