Related papers: Twin-width and permutations
Given a connected graph $G(V, E)$, the edge dimension, denoted $\mathrm{edim}(G)$, is the least size of a set $S \subseteq V$ that distinguishes every pair of edges of $G$, in the sense that the edges have pairwise distinct tuples of…
Let $\mathbb{E}(H)$ and $\mathbb{V}(H)$ denote the edge set and the vertex set of the simple connected graph $H$, respectively. The mixed metric dimension of the graph $H$ is the graph invariant, which is the mixture of two important graph…
Boettcher, Schacht and Taraz gave a condition on the minimum degree of a graph G on n vertices that ensures G contains every r-chromatic graph H on n vertices of bounded degree and of bandwidth o(n), thereby proving a conjecture of Bollobas…
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…
A graph class $\mathcal{G}$ has linear growth if, for each graph $G \in \mathcal{G}$ and every positive integer $r$, every subgraph of $G$ with radius at most $r$ contains $O(r)$ vertices. In this paper, we show that every graph class with…
We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give $n^{\mathcal{O}(w)}$-time algorithms on graphs of mim-width at…
The mim-width of a graph is a powerful structural parameter that, when bounded by a constant, allows several hard problems to be polynomial-time solvable - with a recent meta-theorem encompassing a large class of problems [SODA2023]. Since…
Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each $k$, there is a finite obstruction set $\mathcal{O}_k$ of graphs such that…
In recent years, there has been significant interest in characterizing the induced subgraph obstructions to bounded treewidth and pathwidth. While this has recently been resolved for pathwidth, the case of treewidth remains open, and prior…
We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…
Bavard proved a duality theorem between commutator length and quasimorphisms. Burago, Ivanov and Polterovich introduced the notion of a conjugation-invariant norm which is a generalization of commutator length. Entov and Polterovich proved…
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
Threshold graphs are recursive deterministic network models that have been proposed for describing certain economic and social interactions. One drawback of this graph family is that it has limited generative attachment rules. To mitigate…
A bridgeless cubic graph $G$ is said to have a 2-bisection if there exists a 2-vertex-colouring of $G$ (not necessarily proper) such that: (i) the colour classes have the same cardinality, and (ii) the monochromatic components are either an…
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterion for the quality of a drawing is the number of edge…
The subdivided double construction on 4-regular graphs was used by Poto\v{c}nik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that…
A semiorder is a model of preference relations where each element $x$ is associated with a utility value $\alpha(x)$, and there is a threshold $t$ such that $y$ is preferred to $x$ iff $\alpha(y) > \alpha(x)+t$. These are motivated by the…
Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…
A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The author recently showed in arXiv:1006.2814…