Unavoidable configurations in complete topological graphs

Pach, J. and Solymosi, J. and Tóth, Gábor András (2003) Unavoidable configurations in complete topological graphs. DISCRETE & COMPUTATIONAL GEOMETRY, 30. pp. 311-320.

Full text not available from this repository.
Item Type: Article
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Eszter Nagy
Date Deposited: 11 Dec 2012 15:11
Last Modified: 11 Dec 2012 15:11
URI: https://eprints.sztaki.hu/id/eprint/3270

Update Item Update Item