Papers
Topics
Authors
Recent
Search
2000 character limit reached

Regular decomposition of the edge set of graphs with applications

Published 25 Sep 2021 in math.CO | (2109.12394v2)

Abstract: We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Béla Csaba 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up