Author： Pach Janos Radoicic Rados Tardos Gabor Toth Geza
Publisher： Springer Publishing Company
ISSN： 0179-5376
Source： Discrete & Computational Geometry, Vol.36, Iss.4, 2006-12, pp. : 527-552
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
European Journal of Combinatorics, Vol. 19, Iss. 6, 1998-08 ,pp. :
Access to resources
Recommend
On sparse graphs with given colorings and homomorphisms
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
Homomorphisms from sparse graphs with large girth
By Borodin O.V. Kim S.-J. Kostochka A.V. West D.B.
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
Infinitary logics and very sparse random graphs
The Journal of Symbolic Logic, Vol. 62, Iss. 2, 1997-06 ,pp. :
On finding robust approximate inverses for large sparse matrices
Linear and Multilinear Algebra, Vol. 62, Iss. 10, 2014-10 ,pp. :