首页 | 本学科首页   官方微博 | 高级检索  
     


Boundedness of optimal matrices in extremal multigraph and digraph problems
Authors:Alexander Sidorenko
Affiliation:(1) Courant Institute of Math. Sci., 251 Mercer Street, 10012, N.Y., USA
Abstract:We consider multigraphs in which any two vertices are joined by at mostq edges, and study the Turán-type problem for a given family of forbidden multigraphs. In the caseq=2, answering a question of Brown, Erdodblacs and Simonovits, we obtain an explicit upper bound on the size of the matrix generating an asymptotical solution of the problem. In the caseq>2 we show that some analogous statements do not hold, and so disprove a conjecture of Brown, Erdodblacs and Simonovits.
Keywords:05 C 35  05 C 50
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号