相关论文: The Nash-Williams orientation theorem for graphs w…

In infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones. Nash-Willian's Tree-Packing Theorem…

Two graphs $G$ and $H$ are \emph{hypomorphic} if there exists a bijection $\varphi \colon V(G) \rightarrow V(H)$ such that $G - v \cong H - \varphi(v)$ for each $v \in V(G)$. A graph $G$ is \emph{reconstructible} if $H \cong G$ for all $H$…

A graph $G$ has maximal local edge-connectivity $k$ if the maximum number of edge-disjoint paths between every pair of distinct vertices $x$ and $y$ is at most $k$. We prove Brooks-type theorems for $k$-connected graphs with maximal local…

We show that for $k \geq 2$, there exists a function $f(k) = O(k)$ such that every $k$-connected graph $G$ of order $n \geq f(k)$ with minimum degree at least $\frac{n}{2}$ contains a Hamiltonian cycle $H$ such that $G-E(H)$ is…

For minimally $k$-connected graphs on $n$ vertices, Mader proved a tight lower bound for the number $|V_k|$ of vertices of degree $k$ in dependence on $n$ and $k$. Oxley observed 1981 that in many cases a considerably better bound can be…

We disprove a conjecture of Frank stating that each weakly 2k-connected has a k-vertex-connected orientation. For k at least 3, we also prove that the problem of deciding whether a graph has a k-vertex-connected orientation is NP-complete.

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…

In a graph $G$, a subset of vertices $S \subseteq V(G)$ is said to be cyclable if there is a cycle containing the vertices in some order. $G$ is said to be $k$-cyclable if any subset of $k \geq 2$ vertices is cyclable. If any $k$…

In this paper we give an approximate answer to a question of Nash-Williams from 1970: we show that for every \alpha > 0, every sufficiently large graph on n vertices with minimum degree at least (1/2 + \alpha)n contains at least n/8…

Finding a Steiner strongly $k$-arc-connected orientation is particularly relevant in network design and reliability, as it guarantees robust communication between a designated set of critical nodes. Kir\'aly and Lau (FOCS 2006) introduced a…

A topological graph is $k$-quasi-planar if it does not contain $k$ pairwise crossing edges. A 20-year-old conjecture asserts that for every fixed $k$, the maximum number of edges in a $k$-quasi-planar graph on $n$ vertices is $O(n)$. Fox…

A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on…

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…

We consider two orientation problems in a graph, namely the minimization of the sum of all the shortest path lengths and the minimization of the diameter. We show that it is NP-complete to decide whether a graph has an orientation such that…

Karo\'nski, {\L}uczak and Thomason conjectured in 2004 that for every finite graph without isolated edge, the edges can be assigned weights from $\{1,2,3\}$ in such a way that the endvertices of each edge have different sums of incident…

An edge of a quasi $k$-connected graph is said to be quasi $k$-contractible if the contraction of the edge results in a quasi $k$-connected graph. We show that every 5-connected graph contains a quasi 5-contractible edge. Furthermore, we…

In 2014, Keevash proved the existence of $(n,q,r)$-Steiner systems (equivalently $K_q^r$-decompositions of $K_n^r$) for all large enough $n$ satisfying the necessary divisibility conditions. In 2021, Glock, K\"uhn, and Osthus proposed 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…

A $K_4$-decomposition of a graph is a partition of its edges into $K_4$s. A fractional $K_4$-decomposition is an assignment of a nonnegative weight to each $K_4$ in a graph such that the sum of the weights of the $K_4$s containing any given…

Let $G$ be a graph, $S$ be a set of vertices of $G$, and $\lambda(S)$ be the maximum number $\ell$ of pairwise edge-disjoint trees $T_1, T_2,..., T_{\ell}$ in $G$ such that $S\subseteq V(T_i)$ for every $1\leq i\leq \ell$. The generalized…