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

In this short note, we give large counterexamples to natural questions about certain order polytopes, in particular, Gelfand--Tsetlin polytopes. Several of the counterexamples are too large to be discovered via a brute-force computer…

Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…

A graph K is square-free if it contains no four-cycle as a subgraph. A graph K is multiplicative if GxH -> K implies G -> K or H -> K, for all graphs G,H. Here GxH is the tensor (or categorical) graph product and G -> K denotes the…

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

We show that the problem of the existence of universal graphs with specified forbidden subgraphs can be systematically reduced to certain critical cases by a simple pruning technique which simplifies the underlying structure of the…

We prove that the quadratically enriched count of rational curves in a smooth toric del Pezzo surface passing through $k$-rational points and pairs of conjugate points in quadratic field extensions $k\subset k(\sqrt{d_i})$ can be determined…

Switching is an operation on a graph that does not change the spectrum of the adjacency matrix, thus producing cospectral graphs. An important activity in the field of spectral graph theory is the characterization of graphs by their…

A well-known conjecture of Gr\"unbaum and Nash-Williams proposes that 4-connected toroidal graphs are hamiltonian. The corresponding results for 4-connected planar and projective-planar graphs were proved by Tutte and by Thomas and Yu,…

Let $K \subset \R^d$ be a smooth convex set and let $\P_\la$ be a Poisson point process on $\R^d$ of intensity $\la$. The convex hull of $\P_\la \cap K$ is a random convex polytope $K_\la$. As $\la \to \infty$, we show that the variance of…

We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…

The Tur\'{a}n number of a graph $H$, denoted $\mbox{ex}(n,H)$, is the maximum number of edges in an $n$-vertex graph with no subgraph isomorphic to $H$. Solymosi conjectured that if $H$ is any graph and $\mbox{ex}(n,H) = O(n^{\alpha})$…

In this paper, we examine roots of graph polynomials where those roots can be considered as structural graph measures. More precisely, we prove analytical results for the roots of certain modified graph polynomials and also discuss…

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Recently, Z.-W. Sun introduced two kinds of polynomials related to the Delannoy numbers, and proved some supercongruences on sums involving those polynomials. We deduce new summation formulas for squares of those polynomials and use them to…

A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph $K_n$. For example, the set of geometric triangles is geometric-packable due to the existence of…

We determine the all-genus Hodge-Gromov-Witten theory of a smooth hypersurface in weighted projective space defined by a chain or loop polynomial. In particular, we obtain the first genus-zero computation of Gromov-Witten invariants for…

In the paper we prove that the number of graphs inscribed into graph of a convex polyhedron and circumscribed around another graph does not exceed 4. For this we first studied Poncelet type problem about the number of convex $n$-gons…

In this note we give a counterexample to a conjecture proposed by Ciliberto about special linear systems of P^n through multiple base points.

We prove that if all roots of the discrete Wronskian with step 1 of a set of quasi-exponentials with real bases are real, simple and differ by at least 1, then the complex span of this set of quasi-exponentials has a basis consisting of…

The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…