92 research outputs found
Provably and Efficiently Approximating Near-cliques using the Tur\'an Shadow: PEANUTS
Clique and near-clique counts are important graph properties with
applications in graph generation, graph modeling, graph analytics, community
detection among others. They are the archetypal examples of dense subgraphs.
While there are several different definitions of near-cliques, most of them
share the attribute that they are cliques that are missing a small number of
edges. Clique counting is itself considered a challenging problem. Counting
near-cliques is significantly harder more so since the search space for
near-cliques is orders of magnitude larger than that of cliques.
We give a formulation of a near-clique as a clique that is missing a constant
number of edges. We exploit the fact that a near-clique contains a smaller
clique, and use techniques for clique sampling to count near-cliques. This
method allows us to count near-cliques with 1 or 2 missing edges, in graphs
with tens of millions of edges. To the best of our knowledge, there was no
known efficient method for this problem, and we obtain a 10x - 100x speedup
over existing algorithms for counting near-cliques.
Our main technique is a space-efficient adaptation of the Tur\'an Shadow
sampling approach, recently introduced by Jain and Seshadhri (WWW 2017). This
approach constructs a large recursion tree (called the Tur\'an Shadow) that
represents cliques in a graph. We design a novel algorithm that builds an
estimator for near-cliques, using an online, compact construction of the
Tur\'an Shadow.Comment: The Web Conference, 2020 (WWW
Recommended from our members
The Chromatic Structure of Dense Graphs
This thesis focusses on extremal graph theory, the study of how local constraints on a graph affect its macroscopic structure. We primarily consider the chromatic structure: whether a graph has or is close to having some (low) chromatic number.
Chapter 2 is the slight exception. We consider an induced version of the classical Turán problem. Introduced by Loh, Tait, Timmons, and Zhou, the induced Turán number ex(n, {H, F-ind}) is the greatest number of edges in an n-vertex graph with no copy of H and no induced copy of F. We asymptotically determine ex(n, {H, F-ind}) for H not bipartite and F neither an independent set nor a complete bipartite graph. We also improve the upper bound for ex(n, {H, K_{2, t}-ind}) as well as the lower bound for the clique number of graphs that have some fixed edge density and no induced K_{2, t}.
The next three chapters form the heart of the thesis. Chapters 3 and 4 consider the Erdős-Simonovits question for locally r-colourable graphs: what are the structure and chromatic number of graphs with large minimum degree and where every neighbourhood is r-colourable? Chapter 3 deals with the locally bipartite case and Chapter 4 with the general case.
While the subject of Chapters 3 and 4 is a natural local to global colouring question, it is also essential for determining the minimum degree stability of H-free graphs, the focus of Chapter 5. Given a graph H of chromatic number r + 1, this asks for the minimum degree that guarantees that an H-free graph is close to r-partite. This is analogous to the classical edge stability of Erdős and Simonovits. We also consider the question for the family of graphs to which H is not homomorphic, showing that it has the same answer.
Chapter 6 considers sparse analogues of the results of Chapters 3 to 5 obtaining the thresholds at which the sparse problem degenerates away from the dense one.
Finally, Chapter 7 considers a chromatic Ramsey problem first posed by Erdős: what is the greatest chromatic number of a triangle-free graph on vertices or with m edges? We improve the best known bounds and obtain tight (up to a constant factor) bounds for the list chromatic number, answering a question of Cames van Batenburg, de Joannis de Verclos, Kang, and Pirot
- …