相关论文: On a Conjecture of Thomassen

This paper establishes sufficient conditions that force a graph to contain a bipartite subgraph with a given structural property. In particular, let $\beta$ be any of the following graph parameters: Hadwiger number, Haj\'{o}s number,…

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.

Mader conjectured that for any tree $T$ of order $m$, every $k$-connected graph $G$ with minimum degree at least $\lfloor\frac{3k}{2}\rfloor +m-1$ contains a subtree $T'\cong T$ such that $G-V(T')$ is $k$-connected. In this paper, we give a…

It is proved that there exists an absolute constant c > 0 such that for every natural number k, every non-bipartite 2-connected graph with average degree at least ck contains k cycles with consecutive odd lengths. This implies the existence…

In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 -…

It was independently conjectured by H\"aggkvist in 1989 and Kriesell in 2011 that given a positive integer $\ell$, every simple eulerian graph with high minimum degree (depending on $\ell$) admits an eulerian tour such that every segment of…

We prove a 1985 conjecture of Gy\'arf\'as that for all $k,\ell$, every graph with sufficiently large chromatic number contains either a complete subgraph with $k$ vertices or an induced cycle of length at least $\ell$.

The \emph{Antimagic Graph Conjecture} asserts that every connected graph $G = (V, E)$ except $K_2$ admits an edge labeling such that each label $1, 2, ..., |E|$ is used exactly once and the sums of the labels on all edges incident with a…

Amos et al. (Discrete Appl. Math. 181 (2015) 1-10) introduced the notion of the $k$-forcing number of graph for a positive integer $k$ as the generalization of the zero forcing number of a graph. The $k$-forcing number of a simple graph…

Let $G=(X,Y;E)$ be a bipartite graph, where $X$ and $Y$ are color classes and $E$ is the set of edges of $G$. Lov\'asz and Plummer \cite{LoPl86} asked whether one can decide in polynomial time that a given bipartite graph $G=(X,Y; E)$…

A digraph $D$ is $k$-linked if for every $2k$-tuple $ x_1,\ldots , x_k, y_1, \ldots , y_k$ of distinct vertices in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$,…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

An old conjecture of Erd\H{o}s and McKay states that if all homogeneous sets in an $n$-vertex graph are of order $O(\log n)$ then the graph contains induced subgraphs of each size from $\{0,1,\ldots, \Omega (n^2)\}$. We prove a bipartite…

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

Thomassen formulated the following conjecture: Every $3$-connected cubic graph has a red-blue vertex coloring such that the blue subgraph has maximum degree $1$ (that is, it consists of a matching and some isolated vertices) and the red…

Let $k$ and $n$ be integers such that $1\leq k \leq n-1$, and let $G$ be a simple graph of order $n$. The $k$-token graph $F_k(G)$ of $G$ is the graph whose vertices are the $k$-subsets of $V(G)$, where two vertices are adjacent in $F_k(G)$…

For a subgraph $G$ of the blow-up of a graph $F$, we let $\delta^*(G)$ be the smallest minimum degree over all of the bipartite subgraphs of $G$ induced by pairs of parts that correspond to edges of $F$. In [Triangle-factors in a balanced…

For a graph $F$, the $k$-subdivision of $F$, denoted $F^k$, is the graph obtained by replacing the edges of $F$ with internally vertex-disjoint paths of length $k$. In this paper, we prove that…

Introduced by Goulden and Jackson in their 1996 paper, the matchings-Jack conjecture and the hypermap-Jack conjecture (also known as the $b$-conjecture) are two major open questions relating Jack symmetric functions, the representation…

In 1976 Faudree and Schelp conjectured that in a hamiltonian-connected graph on $n$ vertices, any two distinct vertices are connected by a path of length $k$ for every $k \ge n/2$. In 1978 Thomassen constructed a (non-cubic and non-planar)…