4 citations · 21 across the 45 of their papers we have counts for
6 papers · 1 filter
A note on high-dimensional discrepancy of subtrees
Lawrence Hollom, Lyuben Lichev, Adva Mond +1
For a tree and a function , the imbalance of a subtree is given by . The -dimensional discrepancy o…
Discrepancies of spanning trees in dense graphs
Lawrence Hollom, Lyuben Lichev, Adva Mond +1
We address several related problems on combinatorial discrepancy of trees in a setting introduced by Erdős, Füredi, Loebl and Sós. Given a fixed tree on vertices and an edg…
Vertex-separating path systems in random graphs
Lyuben Lichev, Nicolás Sanhueza-Matamala
A set is said to be separated by subsets if, for every pair of distinct elements of , there is a set that contains exactly one of them. Imposing struc…
On the local resilience of random geometric graphs with respect to connectivity and long cycles
Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek
Given an increasing graph property , a graph is -resilient with respect to if, for every spanning subgraph where each vertex keeps…
On the -problem of Brown, Erdős and Sós for
Stefan Glock, Jaehoon Kim, Lyuben Lichev +2
Let denote the maximum number of edges in an -vertex -uniform hypergraph containing no subgraph with edges and at most vertices. Brown, Erdős and Sós…
Zero-sum Random Games on Directed Graphs
Luc Attia, Lyuben Lichev, Dieter Mitsche +2
This paper considers a class of two-player zero-sum games on directed graphs whose vertices are equipped with random payoffs of bounded support known by both players. Starting from…