Combinatorial Theory and Its Applications, Volume 1Paul Erdős, Alfréd Rényi, Vera T. Sós |
Common terms and phrases
a₁ a²b a²b³ arbitrary arête automorphism B₁ Beweis bi-coloration Budapest Cayley graph cofinal combinatorial complete graph connected to points consider contains cycle impair D₁ defined denote deux digraphs disjoint divisors E₁ edge of multiplicity elements équilibré ERDŐS EX(p exists extremal digraphs finite follows gibt graph G graph theory Graphen Hamiltonian paths hence holds homeomorphic Hungary hypergraphe I₁ implies induction integer j-chain j₂ Kante Knoten l'ensemble Latin square LEMMA lines locally optimal M₁ M₂ Math matrix Matroid Mengensysteme multigraph n-tuple nombre number of edges obtained order type P₁ partition permutation permutation group problem proof of Theorem prove pseudoquestionnaire RÉNYI result S₁ S₂ SATZ sequenceable set mapping sommets subdigraph subgraph subset summand Suppose T-détecteur T₁ T₂ theory transpositions TURÁN U₁ U₂ V₁ valency vector vertex vertices w₁ x₁