Related papers: Tensor decompositions for SL(2) and outerplanar gr…
Let $H$ be a nonempty graph. A graph is $H$-free if it does not contain any copy of $H$ as a subgraph. The outerplanar Tur\'{a}n number of $H$, denoted by $ex_{_\mathcal{OP}}(n,H)$, is the maximum number of edges among all $H$-free…
The manuscripts tabulates arc lists of the 1, 1, 3, 8, 25, 85, 397 ... unlabeled 2-regular digraphs on n=0, 1, 2, ..., 9 nodes, including disconnected graphs, graphs with multiarcs and/or graphs with loops. Each of these graphs represents…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
Nonlinear $sl(2)$ algebras subtending generalized angular momentum theories are studied in terms of undeformed generators and bases. We construct their unitary irreducible representations in such a general context. The linear $sl(2)$-case…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
A visibility representation is a classical drawing style of planar graphs. It displays the vertices of a graph as horizontal vertex-segments, and each edge is represented by a vertical edge-segment touching the segments of its end vertices;…
The space of invariants of a tensor product of representations of SL(n) is provided with the basis parametrized by wave graphs introduced here especially for this purpose. The proof utilizes a game similar to Tetris, named here L-tris.
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
A pair of non-adjacent edges is said to be separated in a circular ordering of vertices, if the endpoints of the two edges do not alternate in the ordering. The circular separation dimension of a graph $G$, denoted by $\pi^\circ(G)$, is the…
A non-aligned drawing of a graph is a drawing where no two vertices are in the same row or column. Auber et al. showed that not all planar graphs have non-aligned drawings that are straight-line, planar, and in the minimal-possible $n\times…
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…
Tensor products of irreducible representations of the Jordanian quantum algebras U_h(sl(2)) and U_h(su(1,1)) are considered. For both the highest weight finite dimensional representations of U_h(sl(2)) and lowest weight infinite dimensional…
Tensor network diagram (graphical notation) is a useful tool that graphically represents multiplications between multiple tensors using nodes and edges. Using the graphical notation, complex multiplications between tensors can be described…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrary planar graph to index the decomposition. We prove that…
We present novel results related to isomorphic resonance graphs of 2-connected outerplane bipartite graphs. As the main result, we provide a structure characterization for 2-connected outerplane bipartite graphs with isomorphic resonance…
We consider the thickness $\theta (G))$ and outerthickness $\theta _o(G)$ of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickness of graphs in terms of their orientable genus.…
We show that there exists an outerplanar graph on $O(n^{c})$ vertices for $c = \log_2(3+\sqrt{10}) \approx 2.623$ that contains every tree on $n$ vertices as a subgraph. This extends a result of Chung and Graham from 1983 who showed that…
A graph is said to be a segment graph if its vertices can be mapped to line segments in the plane such that two vertices have an edge between them if and only if their corresponding line segments intersect. Kratochv\'{i}l and Kub\v{e}na…
We give universal upper bounds on the relative dimensions of isotypic components of a tensor product of the linear group GL(n) representations and universal upper bounds on the relative dimensions of irreducible components of a tensor…