## Combinatorial theory and its applications, Issue 4, Volume 3 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

Combinatorial Theory and Its Applications, Volume 1 Paul Erdős,Alfréd Rényi,Vera T. Sós Snippet view - 1970 |

Combinatorial Theory and Its Applications, Volume 3 Paul Erdős,Alfréd Rényi,Vera T. Sós Snippet view - 1970 |

### Common terms and phrases

asymptotic beliebige belong Beweis BIBD classes Combinatorial common edges complete graph complete subgraph conjugacy classes connected consider construction cycle of order define denote the number Eigenwert endpoints enthalten ERDOS exists extremal graph finite graphs fixed cycle folgt gibt gilt graph G graph theory Graphen G Hamilton-cycles Hamiltonian Hamiltonian circuits hyperplane incident infinite integer interior positions joined k-tree k-tuple Kanten Knotenpunkte Kreise labelled Lemma log log Logn Math matrix minimal number of cycles number of edges numbers 1,2 obtained omitted edges original cycle ot(G partitions permutation plane of order point-independent possible primitive Prufer problem projective plane proof of Theorem prove Prufer codeword Ramsey's theorem representative system Room Squares rooted tree Satz Selberg sieve sequence Square of side Steiner triple systems subset subtree summands theory total number tree of order triangles Tripel triplets tuples valency vertex vertices weak element Zahl zwei