32 citations · 98 across the 35 of their papers we have counts for
5 papers · 1 filter
Decomposing cubic graphs into isomorphic linear forests
Gal Kronenberg, Shoham Letzter, Alexey Pokrovskiy +1
A common problem in graph colouring seeks to decompose the edge set of a given graph into few similar and simple subgraphs, under certain divisibility conditions. In 1987 Wormald c…
The Turán density of tight cycles in three-uniform hypergraphs
Nina Kamčev, Shoham Letzter, Alexey Pokrovskiy
The Turán density of an -uniform hypergraph , denoted , is the limit of the maximum density of an -vertex -uniform hypergraph not containing a…
Chi-boundedness of graphs containing no cycles with chords
Joonkyung Lee, Shoham Letzter, Alexey Pokrovskiy
We prove that the family of graphs containing no cycle with exactly -chords is -bounded, for large enough or of form with an integer. This ver…
Graphs with Sudoku number
Alexey Pokrovskiy
Recently Lau-Jeyaseeli-Shiu-Arumugam introduced the concept of the "Sudoku colourings" of graphs -- partial -colourings of that have a unique extension to a proper …
A random Hall-Paige conjecture
Alp Müyesser, Alexey Pokrovskiy
A complete mapping of a group is a bijection such that is also bijective. Hall and Paige conjectured in 1955 that a finite group has a com…