


default search action
Journal of Combinatorial Theory, Series B, Volume 176
Volume 176, 2026
- Simón Piga

, Nicolás Sanhueza-Matamala, Mathias Schacht:
The codegree Turán density of 3-uniform tight cycles. 1-6 - Ervin Györi, Binlong Li, Nika Salia

, Casey Tompkins, Kitti Varga, Manran Zhu:
On graphs without cycles of length 0 modulo 4. 7-29 - Maria Chudnovsky, Linda Cook, James Davies, Sang-il Oum

:
Reuniting χ-boundedness with polynomial χ-boundedness. 30-73 - Maria Chudnovsky, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl:

Tree independence number II. Three-path-configurations. 74-96 - Paul Seymour:

Thomassen's theorem on the two-linkage problem in acyclic digraphs: A shorter proof. 97-100 - Sergey Norin, Paul D. Seymour:

Dense minors of graphs with independence number two. 101-110 - Michael Molloy, Erlang Surya, Lutz Warnke:

The degree-restricted random process is far from uniform. 111-162 - Nick Brettell, Charles Semple, Gerry Toft:

Detachable pairs in 3-connected matroids and simple 3-connected graphs. 163-240 - Lele Liu, Bo Ning:

Local properties of the spectral radius and Perron vector in graphs. 241-253 - Micha Christoph, Rajko Nenadov, Kalina Petrova:

The Hamilton space of pseudorandom graphs. 254-267 - Jacob Fox, Jonathan Tidor, Shengtong Zhang:

Triangle Ramsey numbers of complete graphs. 268-286 - Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:

Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors. 287-318

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














