


default search action
Journal of Combinatorial Theory, Series B, Volume 177
Volume 177, 2026
- Jie Han, Xichao Shu

, Guanghui Wang:
Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs. 1-30 - Vojtech Dvorák, Adva Mond, Victor Souza:

The Maker-Breaker percolation game on the square lattice. 31-66 - Jaehoon Kim, Hong Liu, Yantao Tang, Guanghui Wang, Donglei Yang, Fan Yang

:
Extremal density for subdivisions with length or sparsity constraints. 67-104 - Kristóf Bérczi

, Bence Mátravölgyi, Tamás Schwarcz:
Reconfiguration of basis pairs in regular matroids. 105-142 - Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh:

When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices. 143-185 - Eero Räty, István Tomon:

Bisection width, discrepancy, and eigenvalues of hypergraphs. 186-215 - Andrey Kupavskii:

Intersecting families with covering number 3. 216-233 - Daniel Gonçalves

:
3-colorable planar graphs have an intersection segment representation using 3 slopes. 234-256 - Lukasz Bozyk, Oscar Defrain

, Karolina Okrasa, Michal Pilipczuk:
On digraphs without onion star immersions. 257-272 - Andrey Kupavskii, Arsenii Sagdeev

, Dmitrii Zakharov:
Cutting corners. 273-292

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













