


default search action
Journal of Combinatorial Theory, Series B, Volume 175
Volume 175, 2025
- József Balogh, Felix Christian Clemen, Haoran Luo
:
Non-degenerate hypergraphs with exponentially many extremal constructions. 1-28 - Luke Postle, Evelyne Smith-Roberge
:
Hyperbolicity theorems for correspondence colouring. 29-68 - Anton Bernshteyn, Abhishek Dhawan:
Fast algorithms for Vizing's theorem on bounded degree graphs. 69-125 - Michael Krivelevich, Alan Lew, Peleg Michaeli:
Rigid partitions: From high connectivity to random graphs. 126-170 - Huan Zhou, Jialu Zhu, Xuding Zhu:
Degree-truncated choosability of graphs. 171-186 - Debsoumya Chakraborti, Tuan Tran:
Approximate packing of independent transversals in locally sparse graphs. 187-212 - Bo Ning, Long-Tu Yuan:
Stability in Bondy's theorem on paths and cycles. 213-239

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.