47 citations · 248 across the 64 of their papers we have counts for
72 papers
A note on extremal constructions for the Erdős--Rademacher problem
Xizhi Liu, Oleg Pikhurko
For given positive integers , and , the famous Erd\H os--Rademacher problem asks for the minimum number of -cliques in a graph with vertices a…
Local version of Vizing's theorem for multi-graphs
Clinton T. Conley, Jan Grebik, Oleg Pikhurko
Extending a result of Christiansen, we prove that every mutli-graph admits a proper edge colouring which is local, that is, $ϕ(e)\le \max\{d(x)+π(x…
Forcing Generalized Quasirandom Graphs Efficiently
Andrzej Grzesik, Daniel Kral, Oleg Pikhurko
We study generalized quasirandom graphs whose vertex set consists of parts (of not necessarily the same sizes) with edges within each part and between each pair of parts distri…
On the limit of the positive -degree Turán problem
Oleg Pikhurko
The minimum positive -degree of a non-empty -graph is the maximum such that every -subset of is contained in either none or at least $…
Finite Hypergraph Families with Rich Extremal Turán Constructions via Mixing Patterns
Xizhi Liu, Oleg Pikhurko
We prove that, for any finite set of minimal -graph patterns, there is a finite family of forbidden -graphs such that the extremal Turán constructions for $\math…
On the -problem of Brown, Erdős and Sós
Stefan Glock, Felix Joos, Jaehoon Kim +3
Let be the maximum number of edges of an -uniform hypergraph on vertices not containing a subgraph with edges and at most vertices. In 1973, Brown,…