Related papers: On the Forking Path Conjecture

Nous refutons, sous une certaine hypothese combinatoire, la "nonrevisiting path conjecture". Abstract: In this article, we give, under some hypothesis, a couterexample to the nonrevisiting path conjecture.

We prove a lower bound on the length of the longest $j$-tight cycle in a $k$-uniform binomial random hypergraph for any $2 \le j \le k-1$. We first prove the existence of a $j$-tight path of the required length. The standard "sprinkling"…

A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\lceil n/2 \rceil$ paths. We prove Gallai's conjecture for…

We prove the Farrell-Jones fibered isomorphism conjecture for several classes of Artin groups of finite and affine types. As a consequence, we compute explicitly the surgery obstruction groups of the finite type pure Artin groups.

Under the assumption that a defining graph of a Coxeter group admits only twists in $\mathbb{Z}_2$ and is of type FC, we prove M\"uhlherr's Twist Conjecture.

Let $K$ be a field and $E$ be a graph. Let $L_K(E)$ be the Leavitt path algebra of $E$ over $K$ with the standard involution $^\star$. We investigate the set of skew-symmetric elements, $\mathbf{K}_{L_K(E)}=\{x\in L_K(E) : x^{\star}=-x\}$,…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…

The Bar\'at-Thomassen conjecture asserts that there is a function $f$ such that for every fixed tree $T$ with $t$ edges, every graph which is $f(t)$-edge-connected with its number of edges divisible by $t$ has a partition of its edges into…

We determine the probability thresholds for the existence of monotone paths, of finite and infinite length, in random oriented graphs with vertex set $\mathbb N^{[k]}$, the set of all increasing $k$-tuples in $\mathbb N$. These graphs…

In 2019, P. Higgins formulated [1] a question about bipartite graphs (see Conjecture 1 below); this question arises in the study of regular finite semigroups. F. V. Petrov formulated [2] another combinatorial conjecture (Conjecture 3);…

We establish maximal trees and graphs for the difference of average distance and proximity proving thus the corresponding conjecture posed in [4]. We also establish maximal trees for the difference of average eccentricity and remoteness and…

This paper gives a definitive solution to the problem of describing conjugacy classes in arbitrary Coxeter groups in terms of cyclic shifts. Let $(W,S)$ be a Coxeter system. A cyclic shift of an element $w\in W$ is a conjugate of $w$ of the…

The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…

We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…

The Longest Path Problem is a question of finding the maximum length between pairs of vertices of a graph. In the general case, the problem is NP-complete. However, there is a small collection of graph classes for which there exists an…

This paper explores the orbit structure and homomesy (constant averages over orbits) properties of certain actions of toggle groups on the collection of independent sets of a path graph. In particular we prove a generalization of a homomesy…

In [7], Higashitani, Kummer, and Micha{\l}ek pose a conjecture about the symmetric edge polytopes of complete multipartite graphs and confirm it for a number of families in the bipartite case. We confirm that conjecture for a number of new…

We construct a family of planar graphs $\{G_n\}_{n\geq 4}$, where $G_n$ has $n$ vertices including a source vertex $s$ and a sink vertex $t$, and edge weights that change linearly with a parameter $\lambda$ such that, as $\lambda$ varies in…

Let $S=(a_1)\cdots(a_k)$ be a minimal zero-sum sequence over a finite cyclic group $G$. The index conjecture states that if $k=4$ and $\gcd(|G|,6)=1$, then $S$ has index $1$. In this paper we prove that if $S$ is singular then the index of…