相关论文: Directed hypergraph connectivity augmentation by h…

For a digraph $D$ and some $X \subseteq V(D)$, the inversion of $X$ is the operation of flipping all arcs both of whose endvertices are in $X$. We initiate the study of establishing arc-connectivity properties by applying inversions of…

We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…

Guo, Li, Shangguan, Tamo, and Wootters formulated in SIAM Journal on Computing a hypergraph Nash--Williams--Tutte conjecture: every $k$-weakly-partition-connected hypergraph on $t$ vertices should admit a $k$-distinguishable tree…

For every fixed $k \ge 4$, it is proved that if an $n$-vertex directed graph has at most $t$ pairwise arc-disjoint directed $k$-cycles, then there exists a set of at most $\frac{2}{3}kt+ o(n^2)$ arcs that meets all directed $k$-cycles and…

Nash-Williams proved that every graph has a well-balanced orientation. A key ingredient in his proof is admissible odd-vertex pairings. We show that for two slightly different definitions of admissible odd-vertex pairings, deciding whether…

By generalizing a recent result of Hong, Liu, and Lai on characterizing the degree-sequences of simple strongly connected directed graphs, a characterization is provided for degree-sequences of simple $k$-node-connected digraphs. More…

Let $D=(V,A)$ be a digraph. For an integer $k\geq 1$, a $k$-arc-connected flip is an arc subset of $D$ such that after reversing the arcs in it the digraph becomes (strongly) $k$-arc-connected. The first main result of this paper introduces…

Computing edge-connected components in directed and undirected graphs is a fundamental and well-studied problem in graph algorithms. In a very recent breakthrough, Korhonen [STOC 2025] showed that for any fixed $k$, the $k$-edge connected…

We give the first almost-linear time algorithm for computing the \emph{maximal $k$-edge-connected subgraphs} of an undirected unweighted graph for any constant $k$. More specifically, given an $n$-vertex $m$-edge graph $G=(V,E)$ and a…

A (possibly directed) graph is $k$-linked if for any two disjoint sets of vertices $\{x_1, \dots, x_k\}$ and $\{y_1, \dots, y_k\}$ there are vertex disjoint paths $P_1, \dots, P_k$ such that $P_i$ goes from $x_i$ to $y_{i}$. A theorem of…

Nash-Williams proved that for an undirected graph $ G $ the set $ E(G) $ can be partitioned into cycles if and only if every cut has either even or infinite number of edges. Later C. Thomassen gave a simpler proof for this and conjectured…

The Nash-Williams conjecture establishes degree sequence conditions ensuring Hamilton cycles in digraphs. An asymptotic version of this conjecture for large digraphs was independently derived by several researchers. We strengthen these…

We derive Cheeger inequalities for directed graphs and hypergraphs using the reweighted eigenvalue approach that was recently developed for vertex expansion in undirected graphs [OZ22,KLT22,JPV22]. The goal is to develop a new spectral…

Vertex connectivity and its variants are among the most fundamental problems in graph theory, with decades of extensive study and numerous algorithmic advances. The directed variants of vertex connectivity are usually solved by manually…

Mader proved that every strongly $k$-connected $n$-vertex digraph contains a strongly $k$-connected spanning subgraph with at most $2kn - 2k^2$ edges, where the equality holds for the complete bipartite digraph ${DK}_{k,n-k}$. For dense…

In 1980, Thomassen stated his weak linkage conjecture: for an odd positive integer k, if a graph G is k-edge-connected, then, for any collection of k pairs of vertices {s_1,t_1}, ..., {s_k,t_k} in G, not necessarily distinct, there are…

In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a…

A well-known result of Chv\'{a}tal and Erd\H{o}s from 1972 states that a graph with connectivity not less than its independence number plus one is hamiltonian-connected. A graph $G$ is called an $[s,t]$-graph if any induced subgraph of $G$…

We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…

A h-uniform hypergraph H=(V,E) is called (l,k)-orientable if there exists an assignment of each hyperedge e to exactly l of its vertices such that no vertex is assigned more than k hyperedges. Let H_{n,m,h} be a hypergraph, drawn uniformly…