Chapter On a theorem of Erdős and Simonovits on graphs not containing the cube

Füredi, Zoltán

doi:10.1515/9783110282429.113

Auteur

Füredi, Zoltán

Contributor(s)

Pintz, János (editor)

Biró, András (editor)

Györy, Kálmán (editor)

Harcos, Gergely (editor)

Simonovits, Miklós (editor)

Szabados, József (editor)

Collection

European Research Council (ERC)

Language

English

Afficher la notice complète

Résumé

Turán graph problem; bipartite extremal graphs; cube graph

Book

Number Theory, Analysis, and Combinatorics: Proceedings of the Paul Turan Memorial Conference held August 22-26, 2011 in Budapest; Number Theory, Analysis, and Combinatorics: Proceedings of the Paul Turan Memorial Conference held August 22-26, 2011 in Budapest; Number Theory, Analysis, and Combinatorics: Proceedings of the Paul Turan Memorial Conference held August 22-26, 2011 in Budapest

URI

https://doab-dev.siscern.org/handle/20.500.12854/153332

Keywords

Turán graph problem; bipartite extremal graphs; cube graph; thema EDItEUR::P Mathematics and Science::PB Mathematics::PBD Discrete mathematics; thema EDItEUR::P Mathematics and Science::PB Mathematics::PBF Algebra; thema EDItEUR::P Mathematics and Science::PB Mathematics::PBH Number theory; thema EDItEUR::P Mathematics and Science::PB Mathematics::PBK Calculus and mathematical analysis; thema EDItEUR::P Mathematics and Science::PB Mathematics::PBV Combinatorics and graph theory