20 citations · 64 across the 12 of their papers we have counts for
4 papers · 1 filter
Monochromatic trees in random tournaments
Matija Bucic, Sven Heberle, Shoham Letzter +1
We prove that, with high probability, in every -edge-colouring of the random tournament on vertices there is a monochromatic copy of every oriented tree of order $O (n / \sq…
Nearly-linear monotone paths in edge-ordered graphs
Matija Bucic, Matthew Kwan, Alexey Pokrovskiy +3
How long a monotone path can one always find in any edge-ordering of the complete graph ? This appealing question was first asked by Chvátal and Komlós in 1971, and has since…
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems
Matija Bucic, Melkior Ornik, Ufuk Topcu
Resilience to damage, component degradation, and adversarial action is a critical consideration in design of autonomous systems. In addition to designing strategies that seek to pr…
Partition problems in high dimensional boxes
Matija Bucic, Bernard Lidicky, Jason Long +1
Alon, Bohman, Holzman and Kleitman proved that any partition of a -dimensional discrete box into proper sub-boxes must consist of at least sub-boxes. Recently, Leader, Mil…