Alon, Noga,; Fischer, Eldar; Newman, Ilan; Shapira, Asaf, A combinatorial characterization of the testable graph properties: it’s all about regularity. SIAM J. Comput. 39 (2009), no. 1, 143–167. Alos, STOC ’06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ...
Shapira, AsafSudakov, BennySpringer Berlin HeidelbergCombinatoricaA. Shapira and B. Sudakov. Small complete minors above the ex- tremal edge density. arXiv preprint arXiv:1208.3568, 2012.A. Shapira and B. Sudakov : Small Complete Minors Above the Extremal Edge Density, arXiv: 1208.3568...
Asaf Shapira & Benny Sudakov 231 Accesses Explore all metrics Abstract A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader’s result...