| |
| |
| |
| Some unsolved problems | |
| |
| |
| |
| |
| Menger's theorem for a countable source set | |
| |
| |
| |
| |
| On extremal set partitions in Cartesian product spaces | |
| |
| |
| |
| |
| Matchings in lattice graphs | |
| |
| |
| |
| |
| Reconstructing a graph from its neighbourhood lists | |
| |
| |
| |
| |
| Threshold functions for H-factors | |
| |
| |
| |
| |
| A rate for the Erdös-Tur��n law | |
| |
| |
| |
| |
| Deterministic graph games | |
| |
| |
| |
| |
| On oriented embedding of the binary tree into the hypercube | |
| |
| |
| |
| |
| Potential theory on distance-regular graphs | |
| |
| |
| |
| |
| On the length of the longest increasing subsequence in a random permutation | |
| |
| |
| |
| |
| On Richardson���s model on the hypercube | |
| |
| |
| |
| |
| Random permutations: some group-theoretic aspects | |
| |
| |
| |
| |
| Ramsey problems with bounded degree spread | |
| |
| |
| |
| |
| Hamilton cycles in random regular digraphs | |
| |
| |
| |
| |
| On triangle contact graphs H. de Fraysseix | |
| |
| |
| |
| |
| A combinatorial approach to complexity theory via ordinal hierarchies | |
| |
| |
| |
| |
| Lattice points of cut cones | |
| |
| |
| |
| |
| The growth of infinite graphs: boundedness | |
| |
| |
| |
| |
| Amalgamated factorizations of complete graphs | |
| |
| |
| |
| |
| Ramsey size linear graphs Paul Erdös | |
| |
| |
| |
| |
| Tur��n-Ramsey theorems | |
| |
| |
| |
| |
| Nearly equal distances in the plane | |
| |
| |
| |
| |
| Clique partitions of chordal graphs | |
| |
| |
| |
| |
| On intersecting chains in Boolean algebras | |
| |
| |
| |
| |
| On the maximum number of triangles in wheel-free graphs | |
| |
| |
| |
| |
| Blocking sets in SQS(2v) | |
| |
| |
| |
| |
| (1,2)-factorisations of general Eulerian nearly regular graphs | |
| |
| |
| |
| |
| Oriented Hamilton cycles in digraphs | |
| |
| |
| |
| |
| Minimization problems for infinite n-connected graphs | |
| |
| |
| |
| |
| On universal threshold graphs | |
| |
| |
| |
| |
| Image partition regularity of matrices | |
| |
| |
| |
| |
| Extremal graph problems for graphs with a color-critical vertex | |
| |
| |
| |
| |
| A note on W1-to-W1 functions | |
| |
| |
| |
| |
| Topological cliques in graphs | |
| |
| |
| |
| |
| Local-global phenomena in graphs | |
| |
| |
| |
| |
| On random generation of the symmetric group | |
| |
| |
| |
| |
| On vertex-edge-critically n-connected graphs | |
| |
| |
| |
| |
| On a conjecture of Erdös | |
| |
| |
| |
| |
| A random recolouring method for graphs and hypergraphs | |
| |
| |
| |
| |
| Obstructions for the disk | |
| |
| |
| |
| |
| A Ramsey-type theorem in the plane | |
| |
| |
| |
| |
| The enumeration of self-avoiding walks domains on a lattice | |
| |
| |
| |
| |
| An extension of Foster's network theorem | |
| |
| |
| |
| |
| Randomised approximation in the Tutte plane | |
| |
| |
| |
| |
| On crossing numbers, and some unsolved problems | |
| |