Skip to content

Author

Hong-Yang Wang

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

A cubic chromatic bound for capped graphs

An ordered graph is capped if, for any four vertices $a<b<c<d$, the edges $ac$ and $bd$ imply the edge $ad$. We prove that every nonempty capped graph $G$ satisfies $\chi(G)\leq\min\{3^{\omega(G)-1},18\omega(G)^3\}$, where $\chi(G)$ and $\omega(G)$ are its chromatic number and clique number. This proves a conjecture of...

Hong-Yang Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.