Related papers: On one example and one counterexample in counting …

An analogy is drawn between recent work with Kley (math.AG/0007082) and the WDVV equations. That is, both are regarded as symmetries of generating functions with coefficients that "count" rational curves on a complex projective manifold. It…

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…

In this paper we will prove a super-analogue of a well-known result by Kontsevich which states that the homology of a certain complex which is generated by isomorphism classes of oriented graphs can be calculated as the Lie algebra homology…

We prove that a polynomial map is invertible if and only if some associated differential ring homomorphism is bijective. To this end, we use a theorem of Crespo and Hajto linking the invertibility of polynomial maps with Picard-Vessiot…

Let $W$ be any wheel graph and $\mathcal{G}$ the class of all countable graphs not containing $W$ as a minor. We show that there exists a graph in $\mathcal{G}$ which contains every graph in $\mathcal{G}$ as an induced subgraph.

We show that, in general, the characteristic polynomial of a hypergraph is not determined by its ``polynomial deck'', the multiset of characteristic polynomials of its vertex-deleted subgraphs, thus settling the ``polynomial reconstruction…

The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…

A word-representable graph is a simple graph $G$ which can be represented by a word $w$ over the vertices of $G$ such that any two vertices are adjacent in $G$ if and only if they alternate in $w$. It is known that the class of…

Consider a graph obtained by taking edge disjoint union of $k$ complete bipartite graphs. Alon, Saks and Seymour conjectured that such graph has chromatic number at most $k+1$. This well known conjecture remained open for almost twenty…

Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). J\'anos Pach (1981) answered this question in the negative. We…

A graph $G$ is pseudo 2-factor isomorphic if the parity of the number of cycles in a 2-factor is the same for all 2-factors of $G$. Abreu et al. conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the only essentially…

First, we provide another proof that the signed count of the real $J$-holomorphic spheres (or $J$-holomorphic discs) passing through a generic real configuration of $k$ points is independent of the choice of the real configuration and the…

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

Practical algorithms for solving the Subgraph Homeomorphism Problem are known for only a few small pattern graphs: among these are the wheel graphs with four, five, six, and seven spokes. The length and difficulty of the proofs leading to…

The invariance of the Welschinger numbers for real unnodal Del Pezzo surfaces, which we used for the enumeration of real rational curves on real toric Del Pezzo surfaces (see math.AG/0303378 and IMRN 49 (2003), 2639-2653), follows from…

We study qualitative aspects of the Welschinger-like $\mathbb Z$-valued count of real rational curves on primitively polarized real $K3$ surfaces. In particular, we prove that with respect to the degree of the polarization, at logarithmic…

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Hirzebruch surfaces provide an excellent example to underline the fact that in general symplectic manifolds, Gromov-Witten invariants might well count curves in the boundary components of the moduli space. We use this example to explain in…

We consider manifolds whose transition maps are restrictions of polynomial mappings $\mathbb{R}^n\to\mathbb{R}^n$, and use them to give an equivalent statement of the Jacobian conjecture over the real field.

We continue our quest for real enumerative invariants not sensitive to changing the real structure and extend the construction we uncovered previously for counting curves of anti-canonical degree $\leqslant 2$ on del Pezzo surfaces with…