Another Characterization of the Natural Numbers
✍ Scribed by Thomjas Bedürftig
- Publisher
- John Wiley and Sons
- Year
- 1989
- Tongue
- English
- Weight
- 127 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We give a new refinement of the Genocchi numbers, counting permutations with alternating excedances according to their first letter. These numbers are related to the Seidel triangle for the Genocchi numbers and to a recent refinement by Kreweras of the Genocchi numbers.
Nous montrons que dans la classe des graphes connexes tels ;lue deux a&es incidentes quelconques appartiennent a un et un seul quadrilatere, les hypercrtbes finis sont les graphes de degre minimum n lini et possedant 2" sommets. The fol!owing theorem' is proved: Let % be the class of connected grap
Let C be a simple graph. let JiGI denote the maximum degree of it\ \erlicek. ,III~ Ic~r \ 1 C; 1 denote irs chromatic pumber. Brooks' Theorem asserb lha1 ytG I'--AI G I. unk\\ C; hd.. .I component that is a COI lplete graph K,,,,\_ ,. or ullesq .I1 G I = 2 and G ha\ ;~n c~rld C\CIC