47 citations · 248 across the 64 of their papers we have counts for
8 papers · 1 filter
Poset limits can be totally ordered
Jan Hladky, Andras Mathe, Viresh Patel +1
S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense grap…
Coloring d-Embeddable k-Uniform Hypergraphs
Carl Georg Heise, Konstantinos Panagiotou, Oleg Pikhurko +1
This paper extends the scenario of the Four Color Theorem in the following way. Let H(d,k) be the set of all k-uniform hypergraphs that can be (linearly) embedded into R^d. We inve…
Supersaturation Problem for Color-Critical Graphs
Oleg Pikhurko, Zelealem B. Yilma
The \emph{Turán function} $\ex(n,F)$ of a graph is the maximum number of edges in an -free graph with vertices. The classical results of Turán and Rademacher from 1941 l…
Martin Gardner's minimum no-3-in-a-line problem
Alec S. Cooper, Oleg Pikhurko, John R. Schmitt +1
In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: "What is the smallest number of [queens] you can put on a board…
Quasirandom permutations are characterized by 4-point densities
Daniel Král', Oleg Pikhurko
For permutations P and T of lengths |P|\le|T|, let t(P,T) be the probability that the restriction of T to a random |P|-point set is (order) isomorphic to P. We show that every sequ…
On Possible Turan Densities
Oleg Pikhurko
The Turán density π(H) of a family H of k-graphs is the limit as n tends to infinity of the maximum edge density of an H-free k-graph on n vertices. Let I^k consist of all possible…