Related papers: Strongly connected orientations and integer lattic…
A gauge invariant Hamiltonian representation for SU(2) in terms of a spin network basis is introduced. The vectors of the spin network basis are independent and the electric part of the Hamiltonian is diagonal in this representation. The…
We study when a given edge of a factor-critical graph is contained in a matching avoiding exactly one, pregiven vertex of the graph. We then apply the results to always partition the vertex-set of a $3$-regular, $3$-uniform hypergraph into…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
In the Vertex Disjoint Paths with Congestion problem, the input consists of a digraph $D$, an integer $c$ and $k$ pairs of vertices $(s_i, t_i)$, and the task is to find a set of paths connecting each $s_i$ to its corresponding $t_i$,…
The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Paths, Rooted Minor Checking, and Folio. A key ingredient behind…
We study the integral points on $\mathbb P_ n\setminus D$, where $D$ is the branch locus of a projection from an hypersurface in $\mathbb P_{n+1}$ to a hyperplane $H\simeq\mathbb P_n$. In doing that we follow the approach proposed in a…
It is an intriguing question to see what kind of information on the structure of an oriented graph $D$ one can obtain if $D$ does not contain a fixed oriented graph $H$ as a subgraph. The related question in the unoriented case has been an…
In this paper we give a combinatorial view on the adjunction theory of toric varieties. Inspired by classical adjunction theory of polarized algebraic varieties we define two convex-geometric notions: the Q-codegree and the nef value of a…
The girth of a graph $G$ is the length of a shortest cycle of $G$. Jiang (JCT-B, 2001) showed that every graph $G$ with girth at least $2\ell+1$ and minimum degree at least $k/\ell$ contains every tree $T$ with $k$ edges whose maximum…
This paper has two objectives. First, we study lattices with skew-Hermitian forms over division algebras with positive involutions. For division algebras of Albert types I and II, we show that such a lattice contains an "orthogonal" basis…
The set of permutations on a finite set can be given the lattice structure known as the weak Bruhat order. This lattice structure is generalized to the set of words on a fixed alphabet $\Sigma$ = {x,y,z,...}, where each letter has a fixed…
Given a finite set $ S $ of points, we consider the following reconfiguration graph. The vertices are the plane spanning paths of $ S $ and there is an edge between two vertices if the two corresponding paths differ by two edges (one…
Discovery of (strong) association rules, or implications, is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic web. We introduce a novel approach for the discovery of a…
We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…
Motivated by the theorem of Gy\H ori and Lov\'asz, we consider the following problem. For a connected graph $G$ on $n$ vertices and $m$ edges determine the number $P(G,k)$ of unordered solutions of positive integers $\sum_{i=1}^k m_i = m$…
Given a digraph $D$ with $m $ arcs, a bijection $\tau: A(D)\rightarrow \{1, 2, \ldots, m\}$ is an antimagic labeling of $D$ if no two vertices in $D$ have the same vertex-sum, where the vertex-sum of a vertex $u $ in $D$ under $\tau$ is the…
A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…
We consider the graph $\Gamma_{\rm{virt}}(G)$ whose vertices are the elements of a finitely generated profinite group $G$ and where two vertices $x$ and $y$ are adjacent if and only if they topologically generate an open subgroup of $G$. We…
In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…