47 citations · 248 across the 64 of their papers we have counts for
5 papers · 1 filter
Minimum number of monotone subsequences of length 4 in permutations
József Balogh, Ping Hu, Bernard Lidický +3
We show that for every sufficiently large , the number of monotone subsequences of length four in a permutation on points is at least $\binom{\lfloor n/3 \rfloor}{4} + \bino…
Measurable equidecompositions via combinatorics and group theory
Łukasz Grabowski, András Máthé, Oleg Pikhurko
We give a sketch of proof that any two (Lebesgue) measurable subsets of the unit sphere in , for , with non-empty interiors and of the same measure are equidecomposabl…
Kőnig's Line Coloring and Vizing's Theorems for Graphings
Endre Csóka, Gabor Lippner, Oleg Pikhurko
The classical theorem of Vizing states that every graph of maximum degree admits an edge-coloring with at most colors. Furthermore, as it was earlier shown by Kőnig, …
How unproportional must a graph be?
Humberto Naves, Oleg Pikhurko, Alex Scott
Let be the maximum over all -vertex graphs of by how much the number of induced copies of in differs from its expectation in the binomial random graph wit…
Monochromatic Clique Decompositions of Graphs
Henry Liu, Oleg Pikhurko, Teresa Sousa
Let be a graph whose edges are coloured with colours, and be a -tuple of graphs. A monochromatic -decomposition of is a pa…