15 citations · 39 across the 20 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
A Note on Even Cycles and Quasi-Random Tournaments
Subrahmanyam Kalyanasundaram, Asaf Shapira
A cycle C={v_1,v_2,....,v_1} in a tournament T is said to be even, if when walking along C, an even number of edges point in the wrong direction, that is, they are directed from v_…
math.CO2011★ 5 cited
A Wowzer Type Lower Bound for the Strong Regularity Lemma
Subrahmanyam Kalyanasundaram, Asaf Shapira
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to…