1,723,319 research outputs found
Edge-transitive embeddings of complete graphs
Building on earlier work of Biggs, James, Wilson and the author and on the Graver-Watkins description of the 14 classes of edge-transitive maps, we complete the classification of the edge-transitive embeddings of complete graphs, including those with non-empty boundary.</p
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined. The method depends on earlier classifications in the cases where n is a prime power, obtained in collaboration with Du, Kwak, Nedela and koviera, together with results of Itô, Hall, Huppert and Wielandt on factorisable groups and on finite solvable groups. <br/
Une autre histoire sociale ? (note critique)
Jones Gareth Stedman. Une autre histoire sociale ? (note critique). In: Annales. Histoire, Sciences Sociales. 53ᵉ année, N. 2, 1998. pp. 383-394
La loi anglaise de 1958 sur l'adoption. Exposé critique
Jones Gareth H. La loi anglaise de 1958 sur l'adoption. Exposé critique. In: Revue internationale de droit comparé. Vol. 13 N°3, Juillet-septembre 1961. pp. 568-571
Maps admitting trialities but not dualities
We use group theory to construct infinite families of maps on surfaces which are invariant under Wilson's map operations of order 3 but not under the operations of order 2, such as duality and Petrie duality
Exotic behaviour of infinite hypermaps
This is a survey of infinite hypermaps, and of how they can be constructed by using examples and techniques from combinatorial group theory, with particular emphasis on phenomena which have no analogues for finite hypermaps.<br/
L'importance de Londres dans l'histoire de la Grande-Bretagne contemporaine
Stedman Jones Gareth, Goujon Florence. L'importance de Londres dans l'histoire de la Grande-Bretagne contemporaine. In: Genèses, 1, 1990. Les voies de l'histoire, sous la direction de Gérard Noiriel. pp. 47-57
Realisation of groups as automorphism groups in permutational categories
It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, or of coverings of a suitable topological space, every countable group A is isomorphic to the automorphism group of uncountably many non-isomorphic objects, infinitely many of them finite if A is finite. In particular, the latter applies to dessins d’enfants, regarded as finite oriented hypermaps.</p
Infinite Paley graphs
Infinite analogues of the Paley graphs are constructed, based on uncountably many locally finite fields. By using character sum estimates due to Weil, they are shown to be isomorphic to the countable random graph of Erdős, Rényi and Rado
- …
