A new proof of several inequalities on codes and sets
β Scribed by Laszlo Babai; Hunter Snevily; Richard M Wilson
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 344 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Ao and Hanson, and Guiduli, Gya Γ rfa Γ s, Thomasse Γ and Weidl independently, proved the following result: For any tournament score sequence S (s 1 , s 2 ,F F F,s n ) with s 1 s 2 Γ Γ Γ s n , there exists a tournament T on vertex set f1Y 2Y F F F Y ng such that the score of each vertex i is s i an
Graffiti is a computer program that checks for relationships among certain graph invariants. It uses a database of graphs and has generated well over 700 conjectures. Having obtained a readily available computer tape of all the nonisomorphic graphs with 10 or fewer vertices, we have tested approxima
Isbell proved his famous zigzag theorem for semigroups using essentially topological methods in [Epimorphisms and dominions, in "Proceedings of the Conference on Categorical Algebra, La Jolla, 1965," pp. 232-246]. Since then a number of authors have proved this result using a variety of different te