Related papers: Left-cut-percolation and induced-Sidorenko bigraph…
Tree-decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. The main property of tree-decompositions is the width (the maximum size of a bag minus 1). We show that every graph has a…
Objective: X-ray computed tomography employing sparse projection views has emerged as a contemporary technique to mitigate radiation dose. However, due to the inadequate number of projection views, an analytic reconstruction method…
This article gives a summary of the author's Ph.D. dissertation (arXiv:1609.06297). In addition to an overview of notions and results, it also provides sketches of various proofs and simplified presentations of certain abstract results of…
We prove that when Kontsevich's deformation quantization is applied on weight homogeneous Poisson structures, the operators in the $\ast-$ product formula are weight homogeneous. We then consider the linear Poisson case…
Abstraction and refinement is widely used in software development. Such techniques are valuable since they allow to handle even more complex systems. One key point is the ability to decompose a large system into subsystems, analyze those…
Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…
When G denotes a graph, the unlabeled subgraph obtained by deleting a vertex from G is called a card of G and the collection of all cards of G is the deck of G. A graph having the same deck as G is called a hypomorph of G. A graph is called…
\emph{Bidirected graphs} (a sort of nonstandard graphs introduced by Edmonds and Johnson) provide a natural generalization to the notions of directed and undirected graphs. By a \emph{weakly (node- or edge-) acyclic} bidirected graph we…
In this paper we study the variety of one dimensional representations of a finite $W$-algebra attached to a classical Lie algebra, giving a precise description of the dimensions of the irreducible components. We apply this to prove a…
Bidimensionality is the most common technique to design subexponential-time parameterized algorithms on special classes of graphs, particularly planar graphs. The core engine behind it is a combinatorial lemma of Robertson, Seymour and…
A classical result by Erdos and Posa states that there is a function $f: {\mathbb N} \rightarrow {\mathbb N}$ such that for every $k$, every graph $G$ contains $k$ pairwise vertex disjoint cycles or a set $T$ of at most $f(k)$ vertices such…
Given two non-empty graphs $H$ and $T$, write $H\succcurlyeq T$ to mean that $t(H,G)^{|E(T)|}\geq t(T,G)^{|E(H)|}$ for every graph $G$, where $t(\cdot,\cdot)$ is the homomorphism density function. We obtain various necessary and sufficient…
Local Irregularity Conjecture states that every simple connected graph, except special cacti, can be decomposed into at most three locally irregular graphs, i.e., graphs in which adjacent vertices have different degrees. The connected…
Decomposable graphs are known for their tedious and complicated Markov update steps. Instead of modelling them directly, this work introduces a class of tree-dependent bipartite graphs that span the projective space of decomposable graphs.…
We show that every connected graph $G$ has a tree decomposition indexed by a tree $T$ such that $T$ is a subgraph of $G$ and the width of the tree decomposition is bounded from above by a function of the pathwidth of $G$. This answers a…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
Given a real, twisted Dirac structure $L$ on a smooth manifold $M$, and a closed embedded submanifold $N\subseteq M$ of codimension $>1$, we characterise when $L$ lifts to a smooth, twisted Dirac structure on the real projective blowup of…
The Steiner Forest problem is an important generalization of the Steiner Tree problem. We are given an undirected graph with nonnegative edge costs and a collection of pairs of vertices. The task is to compute a cheapest forest with the…
The $h$-trimming of a tree is a natural regularization procedure which consists in pruning the small branches of a tree: given $h\geq0$, it is obtained by only keeping the vertices having at least one leaf above them at a distance greater…
We give an approach for relative and degenerate Gromov--Witten invariants, inspired by that of Jun Li but replacing predeformable maps by transversal maps to a twisted target. The main advantage is a significant simplification in the…