Related papers: How Not to Characterize Planar-emulable Graphs
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent using theory developed by Chatterjee and…
A well known theorem of Kuratowski in 1932 states that a graph is planar if, and only if, it does not contain a subdivision of $K_5$ or $K_{3,3}$. Wagner proved in 1937 that if a graph other than $K_5$ does not contain any subdivision of…
With the rising interest in graph representation learning, a variety of approaches have been proposed to effectively capture a graph's properties. While these approaches have improved performance in graph machine learning tasks compared to…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…
We extend the theory of probability graphons, continuum representations of edge-decorated graphs arising in graph limits theory, to the 'right convergence' point of view. First of all, we generalise the notions of overlay functionals and…
We introduce the notion of coarse bottlenecking in graphs and coarse skeletons of graphs and show how bottlenecking guarantees that a skeleton resembles (up to quasi-isometry) the original graph. We show how these tools can be used to…
Learning on temporal graphs has become a central topic in graph representation learning, with numerous benchmarks indicating the strong performance of state-of-the-art models. However, recent work has raised concerns about the reliability…
In [15], V. Jimenez and J. Llibre characterized, up to homeomorphism, the omega limit sets of analytic vector fields on the sphere and the projective plane. The authors also studied the same problem for open subsets of these surfaces.…
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of an internally 3-connected graph, we show how to morph the drawing to one with strictly convex faces while maintaining planarity at all…
Prompted by results of Guardo, Van Tuyl and the second author for lines in projective 3 space, we develop asymptotic upper bounds for the least degree of a homogeneous form vanishing to order at least m on a union of disjoint r dimensional…
We completely characterize triangulations of the projective plane that have a spanning bipartite quadrangulation subgraph. This is an affirmative answer to a question by K\"undgen and Ramamurthi (J Combin Theory Ser B 85, 307--337, 2002)…
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded degree graphs and also for proper minor closed classes. This is…
Graph matching is one of the most important problems in graph theory and combinatorial optimization, with many applications in various domains. Although meta-heuristic algorithms have had good performance on many NP-Hard and NP-Complete…
By studying spaces of flow graphs in a closed oriented manifold, we construct operations on its cohomology, parametrized by the homology of the moduli spaces of compact Riemann surfaces with boundary marked points. We show that the…
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
The aim of this paper is to clarify the relationship between Gromov-hyperbolicity and amenability for planar maps.
Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of $K_5$. This conjecture was proved by Ma and Yu for graphs containing $K_4^-$, and an important step in their proof…
How might one test the hypothesis that networks were sampled from the same distribution? Here, we compare two statistical tests that use subgraph counts to address this question. The first uses the empirical subgraph densities themselves as…