Péter Csíkvári

collaborators

3 papers

math.CO2016

Graphs with Integer Matching Polynomial Roots

S. Akbari, P. Csikvari, A. Ghafari +2

In this paper, we study graphs whose matching polynomial have only integer zeros. A graph is matching integral if the zeros of its matching polynomial are all integers. We characte…

math.CO2014

The Density Turán problem

Péter Csikvári, Zoltán Lóránt Nagy

Let $H$ be a graph on $n$ vertices and let the blow-up graph $G [H]$ be defined as follows. We replace each vertex $v_{i}$ of $H$ by a cluster $A_{i}$ and connect some pairs of vertices…

math.CO2014

Matchings in vertex-transitive bipartite graphs

Péter Csikvári

A theorem of A. Schrijver asserts that a $d$ -regular bipartite graph on $2 n$ vertices has at least $(\frac{( d - 1 ) ^{d - 1}}{d ^{d - 2}})^{n}$ perfect matchings. L. Gurvits gave…