


default search action
Journal of Combinatorial Theory, Series B, Volume 167
Volume 167, 2024
- Suyun Jiang
, Hong Liu, Nika Salia
:
How connectivity affects the extremal number of trees. 1-14 - Zequn Lv, Ervin Györi, Zhen He, Nika Salia
, Casey Tompkins, Xiutao Zhu:
The maximum number of copies of an even cycle in a planar graph. 15-22 - Jiaxi Nie
:
Turán theorems for even cycles in random hypergraph. 23-54 - Allan Lo, Simón Piga
, Nicolás Sanhueza-Matamala:
Cycle decompositions in k-uniform hypergraphs. 55-103 - Attila Joó
:
Finite matchability under the matroidal Hall's condition. 104-118 - Nitya Mani
, Edward Yu
:
Turán problems for mixed graphs. 119-163 - Maryam Abdi, Ebrahim Ghorbani:
Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures. 164-188 - Raphael W. Jacobs
, Paul Knappe
:
Efficiently distinguishing all tangles in locally finite graphs. 189-214 - Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet
, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek:
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. 215-249 - Lyuben Lichev
, Dieter Mitsche, Guillem Perarnau:
Percolation on dense random graphs with given degrees. 250-282 - Stefan Grosser, Hamed Hatami, Peter Nelson
, Sergey Norin:
Typical structure of hereditary properties of binary matroids. 283-302 - Xizhi Liu
:
Cancellative hypergraphs and Steiner triple systems. 303-337 - Clément Dallard
, Martin Milanic
, Kenny Storgel:
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. 338-391 - Dávid Kunszenti-Kovács, László Lovász, Balázs Szegedy:
Random homomorphisms into the orthogonality graph. 392-444

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.