Transitive Decompositions of Graphs and Their Links with Geometry and Origami
โ Scribed by Geoffrey Pearce
- Book ID
- 120046100
- Publisher
- Mathematical Association of America
- Year
- 2010
- Tongue
- English
- Weight
- 236 KB
- Volume
- 117
- Category
- Article
- ISSN
- 0002-9890
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let H be a tree on h 2 vertices. It is shown that if n is sufficiently large and G=(V, E ) is an n-vertex graph with $(G) wnร2x , then there are w |E |ร(h&1)x edge-disjoint subgraphs of G which are isomorphic to H. In particular, if h&1 divides |E | then there is an H-decomposition of G. This result
## Abstract Two resolutions __R__ and __R__^โฒ^ of a combinatorial design are called orthogonal if |__R__~__i__~โฉ__R__|โค1 for all __R__~__i__~โ__R__ and __R__โ__R__^โฒ^. A set __Q__={__R__^1^, __R__^2^, โฆ, __R__^__d__^} of __d__ resolutions of a combinatorial design is called a set of mutually orthog
A graph X is said to be 1 2 -transitive if its automorphism group Aut X acts vertex-and edge-, but not arc-transitively on X. Then Aut X induces an orientation of the edges of X. If X has valency 4, then this orientation gives rise to so-called alternating cycles, that is even length cycles in X who
Let be an X -symmetric graph admitting an X -invariant partition B on V ( ) such that B is connected and (X , 2)-arc transitive. A characterization of ( , X , B) was given in [S. Zhou Eur J Comb 23 (2002), 741-760] for the case where |B|>| (C)โฉB| = 2 for an arc (B, C) of B . We consider in this arti