9 citations · 25 across the 11 of their papers we have counts for
6 papers · 1 filter
Majority Colorings of Sparse Digraphs
Michael Anastos, Ander Lamaison, Raphael Steiner +1
A majority coloring of a directed graph is a vertex-coloring in which every vertex has the same color as at most half of its out-neighbors. Kreutzer, Oum, Seymour, van der Zypen an…
Enumerating extensions of mutually orthogonal Latin squares
Simona Boyadzhiyska, Shagnik Das, Tibor Szabó
Two Latin squares are said to be orthogonal if, for every ordered pair of symbols, there are coordinates such that and $L_2(i…
Singer difference sets and the projective norm graph
Tamás Mészáros, Lajos Rónyai, Tibor Szabó
We demonstrate a close connection between the classic planar Singer difference sets and certain norm equation systems arising from projective norm graphs. This, on the one hand lea…
Exploring Projective Norm Graphs
Tomas Bayer, Tamás Mészáros, Lajos Rónyai +1
The projective norm graphs provide tight constructions for the Turán number of complete bipartite graphs with . In this paper we determine thei…
The maximum length of -Bootstrap Percolation
József Balogh, Gal Kronenberg, Alexey Pokrovskiy +1
Graph-bootstrap percolation, also known as weak saturation, was introduced by Bollobás in 1968. In this process, we start with initial "infected" set of edges , and we infect…
On the Odd Cycle Game and Connected Rules
Jan Corsten, Adva Mond, Alexey Pokrovskiy +2
We study the positional game where two players, Maker and Breaker, alternately select respectively and previously unclaimed edges of . Maker wins if she succeeds in cl…