Corpus ID: 53084559

A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs

@article{Carlson2018ART,
  title={A Ramsey-type Theorem on the Max-Cut Value of d-Regular Graphs},
  author={Charles Carlson and Alexandra Kolla and Luca Trevisan},
  journal={ArXiv},
  year={2018},
  volume={abs/1810.10044}
}
  • Charles Carlson, Alexandra Kolla, Luca Trevisan
  • Published in ArXiv 2018
  • Computer Science, Mathematics
  • In this paper we study the problem of finding large cuts in $K_r$-free graphs with max degree $d$. We show that such graphs always have cuts which cut a $1/2+\Omega(1/d^{1-1/d^{r-2}})$ fraction of edges. This generalizes known results for $K_3$-free graphs. A key component of this result is showing that graphs with few triangles also have non-trivially good cuts. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    2
    Twitter Mentions

    Topics from this paper.

    Citations

    Publications citing this paper.

    Max-Cut in Degenerate H-Free Graphs

    VIEW 6 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 19 REFERENCES

    Maxcut in h - free graphs

    • M. Krivelevich Frieze, O. Pikhurko, T. Szabo
    • Proba - bility and Computing
    • 2012

    Bipartite subgraphs

    On the Independence Number of Sparse Graphs

    The Ramsey Number R(3, t) Has Order of Magnitude t2/log t

    • Jeong Han Kim
    • Computer Science, Mathematics
    • Random Struct. Algorithms
    • 1995
    VIEW 1 EXCERPT

    Bipartite Subgraphs of Triangle-Free Graphs

    A Note on Bipartite Subgraphs of Triangle-Free Graphs