6 citations · 21 across the 27 of their papers we have counts for
18 papers · 1 filter
Uniformity of extremal graph-codes
Noé de Rancourt, Pandelis Dodos, Konstantinos Tyros
It is an important fact that extremal discrete structures -- that is, discrete structures of maximal size among those that avoid certain configurations -- exhibit strong pseudorand…
A universal threshold for geometric embeddings of trees
Dylan J. Altschuler, Pandelis Dodos, Konstantin Tikhomirov +1
A graph is geometrically embeddable into a normed space when there is a mapping such that if and only if , for…
A Dual Ramsey theorem for trees
Stevo Todorcevic, Konstantinos Tyros
We prove a dualization of the Graham--Rothschild Theorem for variable words indexed by homogeneous trees.
Moser-Tardos Algorithm with small number of random bits
Endre Csóka, Łukasz Grabowski, András Máthé +2
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…
A structure theorem for stochastic processes indexed by the discrete hypercube
Pandelis Dodos, Konstantinos Tyros
Let be a finite set with , let be a positive integer, and let denote the discrete -dimensional hypercube (that is, is the Cartesian product o…
Strong Forms of Stability from Flag Algebra Calculations
Oleg Pikhurko, Jakub Sliacan, Konstantinos Tyros
Given a hereditary family of admissible graphs and a function that linearly depends on the statistics of order- subgraphs in a graph , we consider the ex…