2 citations · 3 across the 7 of their papers we have counts for
7 papers
Combinatorial Nullstellensatz and Turán numbers of complete -partite -uniform hypergraphs
Alexey Gordeev
In this note we describe how Lasoń's generalization of Alon's Combinatorial Nullstellensatz gives a framework for constructing lower bounds on the Turán number $\operatorname{ex}(n…
Maximal distance minimizers for a rectangle
D. D. Cherkashin, A. S. Gordeev, G. A. Strukov +1
\emph{A maximal distance minimizer} for a given compact set and some given is a set having the minimal length (one-dimensional Hausdorff measure) o…
On list chromatic numbers of 2-colorable hypergraphs
Danila Cherkashin, Alexey Gordeev
We give an upper bound on the list chromatic number of a 2-colorable hypergraph which generalizes the bound of Schauz on -partite -uniform hypergraphs. It makes sense for spa…
On minimizers of the maximal distance functional for a planar convex closed smooth curve
D. D. Cherkashin, A. S. Gordeev, G. A. Strukov +1
Fix a compact and . A minimizer of the maximal distance functional is a connected set of the minimal length, such that \[ max_{y \in M} dist(y,Σ)…
Alon -- Tarsi numbers of direct products
Alexey Gordeev, Fedor Petrov
We provide a general framework on the coefficients of the graph polynomials of graphs which are Cartesian products. As a corollary, we prove that if is a graph with degre…
The Alon-Tarsi Number of A Toroidal Grid
Zhiguo Li, Zeling Shao, Fedor Petrov +1
The Alon-Tarsi number of a graph is the smallest for which there is an orientation of with max indegree such that the number of even and odd circulati…