Abstract
We say that a graph is embeddable if it is a subgraph of its complement. One of the classic results on graphs embedding says that each graph on n vertices with at most n−2 edges is embeddable. The bound on the number of edges cannot be increased because, for example, the star on n vertices is not embeddable. The reason of this fact is the existence of a vertex with very high degree. In this paper we prove that by forbidding such vertices, one can significantly increase the bound on the number of edges. Namely, we prove that if Δ(G)+|E(G)|≤2n−f(n), where f(n)=o(n), then G is embeddable. Our result is asymptotically best possible, since for the star Sn (which is not embeddable) we have Δ(Sn)+|E(Sn)|=2n−2. As a corollary, we obtain that a digraph embedding conjecture by Benhocine and Wojda (1985) is true for digraphs with sufficiently many symmetric arcs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.