Abstract
A graph of n vertices and {Mathematical expression} edges contains a TKt on at most 7 t2 log t/ε vertices. This answers a question of P. Erdo{combining double acute accent}s.
Original language | English (US) |
---|---|
Pages (from-to) | 83-86 |
Number of pages | 4 |
Journal | Combinatorica |
Volume | 8 |
Issue number | 1 |
DOIs | |
State | Published - Mar 1988 |
Externally published | Yes |
Keywords
- AMS subject classification (1980): 05C35
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Mathematics