nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A new proof of the Larman–Rogers upper bound for the chromatic number of the Euclidean space
|
Prosanov, Roman |
|
|
276 |
C |
p. 115-120 |
artikel |
2 |
Defect of an octahedron in a rational lattice
|
Fadin, Mikhail |
|
|
276 |
C |
p. 37-43 |
artikel |
3 |
Editorial Board
|
|
|
|
276 |
C |
p. ii |
artikel |
4 |
Equitable colorings of hypergraphs with few edges
|
Akhmejanova, Margarita B. |
|
|
276 |
C |
p. 2-12 |
artikel |
5 |
Families of finite sets satisfying intersection restrictions
|
Frankl, Peter |
|
|
276 |
C |
p. 44-49 |
artikel |
6 |
Generalized matroid matching
|
Recski, András |
|
|
276 |
C |
p. 129-133 |
artikel |
7 |
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2
|
Füredi, Zoltán |
|
|
276 |
C |
p. 50-59 |
artikel |
8 |
Multi-symbol forbidden configurations
|
Ellis, Keaton |
|
|
276 |
C |
p. 24-36 |
artikel |
9 |
On clique coverings of complete multipartite graphs
|
Davoodi, Akbar |
|
|
276 |
C |
p. 19-23 |
artikel |
10 |
On colorings of the Boolean lattice avoiding a rainbow copy of a poset
|
Patkós, Balázs |
|
|
276 |
C |
p. 108-114 |
artikel |
11 |
On reconstruction of eigenfunctions of Johnson graphs
|
Vorob’ev, Konstantin |
|
|
276 |
C |
p. 166-171 |
artikel |
12 |
On r -uniform hypergraphs with circumference less than r
|
Kostochka, Alexandr |
|
|
276 |
C |
p. 69-91 |
artikel |
13 |
On separating systems with bounded set size
|
Wiener, Gábor |
|
|
276 |
C |
p. 172-176 |
artikel |
14 |
On the weak chromatic number of random hypergraphs
|
Semenov, Alexander |
|
|
276 |
C |
p. 134-154 |
artikel |
15 |
Ordered size Ramsey number of paths
|
Balogh, József |
|
|
276 |
C |
p. 13-18 |
artikel |
16 |
Positiveness of the permanent of 4-dimensional polystochastic matrices of order 4
|
Taranenko, A.A. |
|
|
276 |
C |
p. 161-165 |
artikel |
17 |
Preface: 2nd Russian–Hungarian Combinatorial Workshop
|
Katona, Gyula O.H. |
|
|
276 |
C |
p. 1 |
artikel |
18 |
Rounds in a combinatorial search problem
|
Gerbner, Dániel |
|
|
276 |
C |
p. 60-68 |
artikel |
19 |
Shattering-extremal set systems from Sperner families
|
Kusch, Christopher |
|
|
276 |
C |
p. 92-101 |
artikel |
20 |
The Brown–Erdős–Sós conjecture in finite abelian groups
|
Solymosi, József |
|
|
276 |
C |
p. 155-160 |
artikel |
21 |
Unlabeled compression schemes exceeding the VC-dimension
|
Pálvölgyi, Dömötör |
|
|
276 |
C |
p. 102-107 |
artikel |
22 |
Zero–one laws for k -variable first-order logic of sparse random graphs
|
Razafimahatratra, A.S. |
|
|
276 |
C |
p. 121-128 |
artikel |