2 papers
math.CO2026
Backward Arcs in Hamilton Oriented Cycles and Paths in Directed Graphs with Independence Number Two
S. Gerke, Q. Guo, G. Gutin +3
In a digraph , an oriented path is a sequence of distinct vertices such that either or or both for every $i\in [p…
math.CO2026
Probabilistic counting lemma for
Warach Veeranonchai
The sparse analogue of Szemerédi's regularity method has played a central role in the development of extremal results for random graphs. While the sparse embedding lemma (the KLR c…