On polynomial degree-boundedness
From MaRDI portal
Cited in
(6)- Counting independent sets in structured graphs
- Induced C₄-free subgraphs with large average degree
- Kővári-Sós-Turán theorem for hereditary families
- The Zarankiewicz problem for polygon visibility graphs
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- On geometric bipartite graphs with asymptotically smallest Zarankiewicz numbers
This page was built for publication: On polynomial degree-boundedness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6989707)