The number of crossings in a regular drawing of the complete bipartite graph.
The number of edges on generalizations of Paley graphs.
The number of -matchings in almost every tree is a zero residue.
The number of graphs not containing as a minor.
The number of labeled 2-connected planar graphs.
The Number of Labeled Dissections of a k-Ball.
The number of labelled -arch graphs.
The number of spanning trees of double graphs
The number of triangles in a tringulation of a set of points in the plane.
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions.
The two uniform infinite quadrangulations of the plane have the same law
We prove that the uniform infinite random quadrangulations defined respectively by Chassaing–Durhuus and Krikun have the same distribution.
Trivial Selmer groups and even partitions of a graph.
Ü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...
Vertex-vectors of quadrangular 3-polytopes with two types of edges
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
Cameron introduced the orbit algebra of a permutation group and conjectured that this algebra is an integral domain if and only if the group has no finite orbit. We prove that this conjecture holds and in fact that the age algebra of a relational structure R is an integral domain if and only if R is age-inexhaustible. We deduce these results from a combinatorial lemma asserting that if a product of two non-zero elements of a set algebra is zero then there is a finite common tranversal of their...
Замечание о верхней оценке степени информационных графов