What can Turán tell us about the hypercube?
The Turán problem is a fundamental problem in extremal graph theory. It asks what the maximum number of edges a given graph G can have, not containing some forbidden graph H, and is solved using the Turán number ex(n,H), density π(H) and graph Tr(n). Turán's theorem tells us that the Turán grap...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Umeå universitet, Institutionen för matematik och matematisk statistik
2012
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-57789 |