| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Cancellative hypergraphs and Steiner triple systems
|
Liu, Xizhi
|
|
|
167 |
C |
p. 303-337
|
artikel
|
| 2 |
Cycle decompositions in k-uniform hypergraphs
|
Lo, Allan
|
|
|
167 |
C |
p. 55-103
|
artikel
|
| 3 |
Editorial Board
|
|
|
|
167 |
C |
p. ii
|
artikel
|
| 4 |
Efficiently distinguishing all tangles in locally finite graphs
|
Jacobs, Raphael W.
|
|
|
167 |
C |
p. 189-214
|
artikel
|
| 5 |
Finite matchability under the matroidal Hall's condition
|
Joó, Attila
|
|
|
167 |
C |
p. 104-118
|
artikel
|
| 6 |
How connectivity affects the extremal number of trees
|
Jiang, Suyun
|
|
|
167 |
C |
p. 1-14
|
artikel
|
| 7 |
Minimum algebraic connectivity and maximum diameter: Aldous–Fill and Guiduli–Mohar conjectures
|
Abdi, Maryam
|
|
|
167 |
C |
p. 164-188
|
artikel
|
| 8 |
Percolation on dense random graphs with given degrees
|
Lichev, Lyuben
|
|
|
167 |
C |
p. 250-282
|
artikel
|
| 9 |
Random homomorphisms into the orthogonality graph
|
Kunszenti-Kovács, Dávid
|
|
|
167 |
C |
p. 392-444
|
artikel
|
| 10 |
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
|
Bonamy, Marthe
|
|
|
167 |
C |
p. 215-249
|
artikel
|
| 11 |
The maximum number of copies of an even cycle in a planar graph
|
Lv, Zequn
|
|
|
167 |
C |
p. 15-22
|
artikel
|
| 12 |
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
|
Dallard, Clément
|
|
|
167 |
C |
p. 338-391
|
artikel
|
| 13 |
Turán problems for mixed graphs
|
Mani, Nitya
|
|
|
167 |
C |
p. 119-163
|
artikel
|
| 14 |
Turán theorems for even cycles in random hypergraph
|
Nie, Jiaxi
|
|
|
167 |
C |
p. 23-54
|
artikel
|
| 15 |
Typical structure of hereditary properties of binary matroids
|
Grosser, Stefan
|
|
|
167 |
C |
p. 283-302
|
artikel
|
Tijdschrift beschrijving