Edge distribution of graphs with few induced copies of a given graph

Simple item page
dc.creatorNikiforov, Vladimir
dc.date2004-04-27
dc.date.accessioned2026-07-07T05:07:46Z
dc.date.available2026-07-07T05:07:46Z
dc.descriptionWe show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
dc.description22 pages, submitted to Comb. Prob. and Comp, author's name expanded
dc.identifierhttps://arxiv.org/abs/math/0404503
dc.identifierhttp://arxiv.org/abs/math/0404503
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/70990
dc.subjectCombinatorics
dc.subject05C75
dc.titleEdge distribution of graphs with few induced copies of a given graph
dc.typetext

Files

Collections

arXiv