Related papers: $\triangle Y$-exchanges and the Conway-Gordon theo…

We give a compact variation of Seymour's proof that every $2$-edge-connected graph has a nowhere-zero $\mathbb{Z}_2 \times \mathbb{Z}_3$-flow.

In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…

For a commutative ring $A$ we consider a related graph, $\Gamma(A)$, whose vertices are the unimodular rows of length $2$ up to multiplication by units. We prove that $\Gamma(A)$ is path-connected if and only if $A$ is a…

A classical theorem of Simonovits from the 1980s asserts that every graph $G$ satisfying ${e(G) \gg v(G)^{1+1/k}}$ must contain $\gtrsim \left(\frac{e(G)}{v(G)}\right)^{2k}$ copies of $C_{2k}$. Recently, Morris and Saxton established a…

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…

Refining a classical proof of Whitney, we show that any $4$-connected planar triangulation can be decomposed into a Hamiltonian path and two trees. Therefore, every $4$-connected planar graph decomposes into three forests, one having…

Let $G$ be a graph with adjacency matrix $A(G)$. We conjecture that \[2n^+(G) \le n^-(G)(n^-(G) + 1),\] where $n^+(G)$ and $n^-(G)$ denote the number of positive and negative eigenvalues of $A(G)$, respectively. This conjecture generalizes…

We study decomposition into simple arcs (i. e., arcs without self-intersections) for diagrams of knots and spatial graphs. In this paper, it is proved in particular that if no edge of a finite spatial graph $G$ is a knotted loop, then there…

We show that the large Cartesian powers of any graph have log-concave valencies with respect to a ffxed vertex. We show that the series of valencies of distance regular graphs is log-concave, thus improving on a result of (Taylor,…

In this paper we present new proofs of the Conway-Gordon-Sachs and Sachs Theorems on the linked cycles in graphs embedded in $\R^3$. We reduce these theorems to certain property of graphs mapped to the plane.

We prove that any three-point genus zero Gromov-Witten invariant on a type A Grassmannian is equal to a classical intersection number on a two-step flag variety. We also give symplectic and orthogonal analogues of this result; in these…

For any smooth complex projective variety X and smooth very ample hypersurface Y in X, we develop the technique of genus zero relative Gromov-Witten invariants of Y in X in algebro-geometric terms. We prove an equality of cycles in the Chow…

Let $\Gamma$ be a {Conway 99-graph}, that is, a strongly regular graph with parameters $(99,14,1,2)$. In Makhnev and Minakova (On automorphisms of strongly regular graphs with parameters $\lambda =1$, $\mu= 2$, Discrete Math.\ Appl.\ 14 (2)…

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…

Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…

This paper develops a new chain model for the commutative graph complex $\mathsf{GC}_2$ which takes Lie graph homology as an input. Our main technical result is the identification of a large contractible complex of (certain) tadpoles and…

Given a graph G, of arbitrary size and unbounded vertex degree, denote by |G| the one-complex associated with $G$. The topological space |G| is n-arc connected (n-ac) if every set of no more than n points of |G| are contained in an arc (a…

We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…