Work

Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties

Year: 2025
Type: preprint
Abstract: Given a function $p : V(G)\to \mathbb N$ and an integer $k\ge 0$, define $p_k(G)$ as the number of vertices with $p(v)\ge k$. We say that $p_k(G)$ is bounded for all $\HH$-free graphs if there exists a constant $c=c(\HH)$ such that $p_k(G)
Authors: Sun, Jin, Hou, Xinmin
Open Access status: green
OpenAlex ID: W7109098051
Cites:
Cited by:
Related to: