## Combinatorial problems and exercisesBasic enumeration; The sieve; Permutations; Two classical enumeration problems in graph theory; Connectivity; Factors of graphs; Extremal problems for graphs; Spectra of graphs; Automorphism of graphs; Hypergraphs; Ramsey theory. |

### What people are saying - Write a review

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

### Contents

Hypergraphs circuits transversal theory intersection | 13 |

moment method Moebius function 19 97 | 175 |

Permutations cycle index polynomial HallRenyi | 196 |

Copyright | |

12 other sections not shown

### Common terms and phrases

2-coloration 2-connected a-critical adjacent assume automorphism group bipartite graph classes complete graph components of G connected graph Consider contradiction cycle cycle index defined degree at least denote the number digraph disjoint edges of G eigenvalues eigenvector elements endpoints Euler trail exactly follows formula graph G Hamiltonian circuit Hamiltonian path Hence hint hypergraph independent set induced subgraph induction hypothesis inner points integers isomorphic joined length Let G Math matrix maximum independent set maximum matching Menger's theorem minimal neighbors number of edges number of partitions number of points obviously odd circuit orientation path permutation planar planar graph points of degree points of G polynomial proves the assertion r-regular recurrence relation remove resulting graph satisfies sequence Similarly simple graph solution spanning tree strongly connected subset Suppose indirectly theorem triangle trivial whence xv x2