Über die Anzahl der inkongruenten ebenen Netze des Würfels und des regulären Oktaeders.
Über endliche Graphen mit vorgegebenen Homomorphieeigenschaften.
Un procédé itératif de dénombrement d'arbres binaires et son application à leur génération aléatoire
Une preuve combinatoire de la rationalité d'une série génératrice associée aux arbres
Universality for and in Induced-Hereditary Graph Properties
The well-known Rado graph R is universal in the set of all countable graphs I, since every countable graph is an induced subgraph of R. We study universality in I and, using R, show the existence of 2 א0 pairwise non-isomorphic graphs which are universal in I and denumerably many other universal graphs in I with prescribed attributes. Then we contrast universality for and universality in induced-hereditary properties of graphs and show that the overwhelming majority of induced-hereditary properties...