Related papers: Arc-Disjoint Cycles and Feedback Arc Sets
Lov\'asz (1965) characterized graphs without two vertex-disjoint cycles, which implies that such graphs have at most three vertices hitting all cycles. In this paper, we ask whether such a small hitting set exists for $S$-cycles, when a…
Thomassen conjectured that there is a function $f(k)$ such that every strongly $f(k)$-connected tournament contains $k$ edge-disjoint Hamiltonian cycles. This conjecture was recently proved by K\"uhn, Lapinskas, Osthus, and Patel who showed…
A circular arc graph is the intersection graph of a collection of connected arcs on the circle. We solve a Tur'an-type problem for circular arc graphs: for n arcs, if m and M are the minimum and maximum number of arcs that contain a common…
A feedback vertex set of a graph is a set of nodes with the property that every cycle contains at least one vertex from the set i.e. the removal of all vertices from a feedback vertex set leads to an acyclic graph. In this short paper, we…
A tournament is a directed graph T such that every pair of vertices are connected by an arc. A feedback vertex set is a set S of vertices in T such that T - S is acyclic. In this article we consider the Feedback Vertex Set problem in…
For an oriented graph $G$, the oriented discrepancy problem concerns the existence of a spanning subgraph of $G$ with a large imbalance between its forward and backward edge orientations. Freschi and Lo proved the Dirac-type Hamilton cycle…
In 1981 Jackson showed that the diregular bipartite tournament (a complete bipartite graph whose edges are oriented so that every vertex has the same in- and outdegree) contains a Hamilton cycle, and conjectured that in fact the edge set of…
The bipartite-hole-number of a graph $G$, denoted by $\widetilde{\alpha}(G)$, is the minimum integer $k$ such that there exist positive integers $s$ and $t$ with $s + t = k + 1$, satisfying the property that for any two disjoint sets $A, B…
The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists in reversing the direction of all arcs of $D\langle X\rangle$. The {\it inversion number} of an oriented graph $D$, denoted by ${\rm inv}(D)$, is the minimum number of…
Let m(G) be the maximum number of vertex-disjoint odd cycles of a graph G and t(G) the minimum number of vertices whose removal makes G bipartite. We show that t(G)<=6m(G) if G is planar. This improves the previous bound t(G)<=10m(G) by…
Let $T$ be a tree with $t$ edges. We show that the number of isomorphic (labeled) copies of $T$ in a graph $G = (V,E)$ of minimum degree at least $t$ is at least \[2|E| \prod_{v \in V} (d(v) - t + 1)^{\frac{(t-1)d(v)}{2|E|}}.\]…
Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.
The famous K\H{o}nig-Egerv\'ary theorem is equivalent to the statement that the matching number equals the vertex cover number for every induced subgraph of some graph if and only if that graph is bipartite. Inspired by this result, we…
We present a new greedy rounding algorithm for the Cycle Packing Problem for uncrossable cycle families in planar graphs. This improves the best-known upper bound for the integrality gap of the natural packing LP to a constant slightly less…
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this…
We prove that if $D$ is a digraph of maximum outdegree and indegree at least $k$, and minimum semidegree at least $k/2$ that contains no oriented $4$-cycles, then $D$ contains each oriented tree $T$ with~$k$ arcs. This can be slightly…
In this paper, we consider a general degree sum condition sufficient to imply the existence of $k$ vertex-disjoint chorded cycles in a graph $G$. Let $\sigma_t(G)$ be the minimum degree sum of $t$ independent vertices of $G$. We prove that…
In the Feedback Arc Set in Tournaments (Subset-FAST) problem, we are given a tournament $D$ and a positive integer $k$, and the objective is to determine whether there exists an arc set $S \subseteq A(D)$ of size at most $k$ whose removal…
We consider the minimum-weight feedback vertex set problem in tournaments: given a tournament with non-negative vertex weights, remove a minimum-weight set of vertices that intersects all cycles. This problem is $\mathsf{NP}$-hard to solve…
The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…