Related papers: Combinatorial modulus and type of graphs

We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…

We prove that random triangulations of high genus contain very large expander subgraphs, answering a question of Benjamini. Our approach relies on new general criteria for arbitrary graphs to contain large expander subgraphs.

We relate two important notions in graph theory: expanders which are highly connected graphs, and modularity a parameter of a graph that is primarily used in community detection. More precisely, we show that a graph having modularity…

We prove that a class of graphs with an excluded minor and with the maximum degree sublinear in the number of edges is maximally modular, that is, modularity tends to 1 as the number of edges tends to infinity.

We investigate the combinatorial analogues, in the context of normal surfaces, of taut and transversely measured (codimension 1) foliations of 3-manifolds. We establish that the existence of certain combinatorial structures, a priori weaker…

For a nondegenerate $r$-graph $F$, large $n$, and $t$ in the regime $[0, c_{F} n]$, where $c_F>0$ is a constant depending only on $F$, we present a general approach for determining the maximum number of edges in an $n$-vertex $r$-graph that…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…

Deep generative models have achieved remarkable success in various data domains, including images, time series, and natural languages. There remain, however, substantial challenges for combinatorial structures, including graphs. One of the…

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

We investigate from an algebraic and topological point of view the minimal prime spectrum of a universal algebra, considering the prime congruences w.r.t. the term condition commutator. Then we use the topological structure of the minimal…

We study the complexity of birational self-maps of a projective threefold $X$ by looking at the birational type of surfaces contracted. These surfaces are birational to the product of the projective line with a smooth projective curve. We…

This paper addresses the topological structures induced on vector spaces by convex modulars that do not satisfy the $\Delta_2$ condition, with particular focus on their applications to variable exponent spaces such as \( \ell^{(p_n)} \) and…

It is well-known that the Brualdi-Hoffman-Tur\'an-type problem inquiries about the maximum spectral radius \( \lambda(G) \) of an \( F \)-free graph \( G \) with \( m \) edges. Let \( \theta_{1,p,q} \) denote the theta graph, which is…

We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…

The binding number $b(G)$ of a graph, introduced by Woodall [J. Combin. Theory, Ser. B, 1973], is a central topic of both structural and extremal graph theory. It is closely related to fundamental combinatorial and structural properties of…

This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…