Related papers: The acyclic directed bunkbed conjecture is false
We give counterexamples to the Brown-Colbourn conjecture on reliability polynomials, in both its univariate and multivariate forms. The multivariate Brown-Colbourn conjecture is false already for the complete graph K_4. The univariate…
A directed cycle double cover of a graph G is a family of cycles of G, each provided with an orientation, such that every edge of G is covered by exactly two oppositely directed cycles. Explicit obstacles to the existence of a directed…
\emph{Bidirected graphs} (a sort of nonstandard graphs introduced by Edmonds and Johnson) provide a natural generalization to the notions of directed and undirected graphs. By a \emph{weakly (node- or edge-) acyclic} bidirected graph we…
We establish the real integral Hodge conjecture for 1-cycles on various classes of uniruled threefolds (conic bundles, Fano threefolds with no real point, some del Pezzo fibrations) and on conic bundles over higher-dimensional bases which…
We give a proof of the Acyclicity Conjecture stated by Broussous and Schneider in [BrouSch2017]. As a consequence, we obtain an exact resolution of every admissible representation on each Bernstein block of ${\rm GL}(N)$ associated to a…
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.
The bunkbed conjecture was first posed by Kasteleyn. If $G=(V,E)$ is a finite graph and $H$ some subset of $V$, then the bunkbed of the pair $(G,H)$ is the graph $G\times\{1,2\}$ plus $|H|$ extra edges to connect for every $v\in H$ the…
We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of "typical" covering maps, and use graph Galois theory to "symmetrize" the conjecture. The conjecture is then…
In this paper, we have developed two algorithms for maintaining acyclicity in a concurrent directed graph. The first algorithm is based on a wait-free reachability query and the second one is based on partial snapshot-based obstruction-free…
In the paper Planarity and Hyperbolicity in Graphs, the authors present the following conjecture: every tessellation of the Euclidean plane with convex tiles induces a non-hyperbolic graph. It is natural to think that this statement holds…
The bunkbed conjecture, which has featured in the folklore of probability theory since at least 1985, concerns bond percolation on the product graph $G\Box K_2$. We have two copies $G_0$ and $G_1$ of $G$, and if $x^{(0)}$ and $x^{(1)}$ are…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
Jaeger's directed cycle double cover conjecture can be formulated as a problem of existence of special perfect matchings in a class of graphs that we call hexagon graphs. In this work, we explore the structure of hexagon graphs. We show…
In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the…
In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].
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…
We study analogues of Sidorenko's conjecture and the forcing conjecture in oriented graphs, showing that natural variants of these conjectures in directed graphs are equivalent to the asymmetric, undirected analogues of the conjectures.
The generalized Chen's conjecture on biharmonic submanifolds asserts that any biharmonic submanifold of a non-positively curved manifold is minimal (see e.g., [CMO1], [MO], [BMO1], [BMO2], [BMO3], [Ba1], [Ba2], [Ou1], [Ou2], [IIU]). In this…
Steinberg conjectured in 1976 that every planar graph with no cycles of length four or five is 3-colorable. We disprove this conjecture.
We prove that, for closed exact embedded Lagrangian submanifolds of cotangent bundles, the homomorphism of homotopy groups induced by the stable Lagrangian Gauss map vanishes. In particular, we prove that this map is null-homotopic for all…