Related papers: Combinatorial modulus and type of graphs

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging…

The parameterized analysis of graph modification problems represents the most extensively studied area within Parameterized Complexity. Given a graph $G$ and an integer $k\in\mathbb{N}$ as input, the goal is to determine whether we can…

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…

We introduce the following combinatorial problem. Let $G$ be a triangle-free regular graph with edge density $\rho$. What is the minimum value $a(\rho)$ for which there always exist two non-adjacent vertices such that the density of their…

Let $G$ be a cancellative $3$-uniform hypergraph in which the symmetric difference of any two edges is not contained in a third one. Equivalently, a $3$-uniform hypergraph $G$ is cancellative if and only if $G$ is $\{F_4, F_5\}$-free, where…

It is well known that spectral Tur\'{a}n type problem is one of the most classical {problems} in graph theory. In this paper, we consider the spectral Tur\'{a}n type problem. Let $G$ be a graph and let $\mathcal{G}$ be a set of graphs, we…

Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…

Higher dimensional graphs can be used to colour two-dimensional geometric graphs. If G the boundary of a three dimensional graph H for example, we can refine the interior until it is colourable with 4 colours. The later goal is achieved if…

A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Clique} on unit disk graphs [Clark, Colbourn, Johnson; Discrete…

Let $T$ be a tree with no degree 2 vertices and $L(T)=\{l_1,\ldots,l_r\}, r \geq 2$ denote the set of leaves in $T$. An Halin graph $G$ is a graph obtained from $T$ such that $V(G)=V(T)$ and $E(G)=E(T) \cup \{\{l_i,l_{i+1}\} ~|~ 1 \leq i…

We consider the problem of satisfaction of boundary conditions when the generalized stress vector is given on the surfaces for elastic plates and shells. This problem was open also both for refined theories in the wide sense and…

We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…

We investigate refinement in the context of choreographies. We introduce refinable global choreographies allowing for the underspecification of protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may…

We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

We prove finite generation of the algebra of type A conformal blocks over arbitrary stable curves of any genus. As an application we construct a flat family of irreducible normal projective varieties over the moduli stack of stable pointed…

We discuss a link between graph theory and geometry that arises when considering graph dynamical systems with odd interactions. The equilibrium set in such systems is not a collection of isolated points, but rather a union of manifolds,…

Maximal $(k+1)$-crossing-free graphs on a planar point set in convex position, that is, $k$-triangulations, have received attention in recent literature, with motivation coming from several interpretations of them. We introduce a new way of…

We introduce a novel model-theoretic framework inspired from graph modification and based on the interplay between model theory and algorithmic graph minors. The core of our framework is a new compound logic operating with two types of…