Abstract

AbstractFor any positive integer , we show that every maximal ‐free graph with at least edges contains an induced complete bipartite subgraph on vertices. We also show that this is the best possible.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call