14 citations · 31 across the 11 of their papers we have counts for
Showing 2014 · math.COShow all
3 papers · 2 filters
math.CO2014
The Density Turán problem
Péter Csikvári, Zoltán Lóránt Nagy
Let be a graph on vertices and let the blow-up graph be defined as follows. We replace each vertex of by a cluster 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 -regular bipartite graph on vertices has at least perfect matchings. L. Gurvits gave…
math.CO2014
Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
Péter Csikvári
Friedland's Lower Matching Conjecture asserts that if is a --regular bipartite graph on vertices, and denotes the number of matchings of size , then $$…