Related papers: On the Forking Path Conjecture

We prove that for every k, there exists $c_k>0$ such that every graph G on n vertices not inducing a path $P_k$ and its complement contains a clique or a stable set of size $n^{c_k}$.

We relate two conjectures which have been raised for classification of Leavitt path algebras. For purely infinite simple unital Leavitt path algebras, it is conjectured that K_0 classifies them completely. For arbitrary Leavitt path…

In this paper we prove Conjecture \ref{conj1} for a set of representations of the group $GL_n({\bf A})$. This Conjecture is stated in complete generality as Conjecture 1 in \cite{G2}, and here we prove it for various cases. See Conjecture…

In this paper, we extend the rectangular side of the shuffle conjecture by stating a rectangular analogue of the square paths conjecture. In addition, we describe a set of combinatorial objects and one statistic that are a first step…

We provide a short proof that a 5-connected nonplanar apex graph contains a subdivided $K_{_5}$ or a $K^-_{_4}$ (= $K_{_4}$ with a single edge removed) as a subgraph. Together with a recent result of Ma and Yu that {\sl every nonplanar…

In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…

For every $g\ge 2$ and $n\ge4$, we provide an $n-$manifold $M$ and a continuous $2-$sided map $f\colon S\longrightarrow M$, where $S$ is a closed genus $g$ surface, such that no simple loop is contained in $\text{ker}(\,f_*\,)$. This…

A forcing set $S$ in a combinatorial problem is a set of elements such that there is a unique solution that contains all the elements in $S$. An anti-forcing set is the symmetric concept: a set $S$ of elements is called an anti-forcing set…

Let $\gamma(S_n)$ be the minimum number of proper subgroups $H_i$ of the symmetric group $S_n$ such that each element in $S_n$ lies in some conjugate of one of the $H_i.$ In this paper we conjecture that…

Let $G$ be a complete $k$-partite simple undirected graph with parts of sizes $p_1\le p_2...\le p_k$. Let $P_j=\sum_{i=1}^jp_i$ for $j=1,...,k$. It is conjectured that $G$ has distance magic labeling if and only if $\sum_{i=1}^{P_j}…

In this note, we prove the K- and L-theoretic Farrell-Jones Conjecture with coefficients in an additive category for fundamental groups of graphs of virtually cyclic groups.

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

We consider the class of directed graphs with $N\geq 1$ edges and without loops shorter than $k\geq1$. Using the concept of a labelled graph, we determine graphs from this class that maximize the number of all paths of length $k$. Then we…

The Merino-Welsh conjecture asserts that the number of spanning trees of a graph is no greater than the maximum of the numbers of totally cyclic orientations and acyclic orientations of that graph. We prove this conjecture for the class of…

Finding paths in graphs is a fundamental graph-theoretic task. In this work, we we are concerned with finding a path with some constraints on its length and the number of vertices neighboring the path, that is, being outside of and incident…

A special case of a conjecture by Thomass\'e is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexample exists, we present reductions and establish bounds on…

The reduced expressions for a given element $w$ of a Coxeter group $(W, S)$ can be regarded as the vertices of a directed graph $\mathcal{R}(w)$; its arcs correspond to the braid moves. Specifically, an arc goes from a reduced expression…

Assume that $P$ and $Q$ are elements of $A_1$ satisfying $[P,Q] = 1$. The Dixmier Conjecture for $A_1$ says that they always generate $A_1$. We show that if $P$ is a sum of not more than~$4$ homogeneous elements of $A_1$ then $P$ and $Q$…

This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph…

We show that for any natural number $k \ge 1$, any oriented graph $D$ of minimum semidegree at least $(3k- 2)/4$ contains an antidirected path of length $k$. In fact, a slightly weaker condition on the semidegree sequence of $D$ suffices,…