✦ LIBER ✦

Ramanujan hypergraphs

✍ Scribed by Wen-Ching Winnie Li

Book ID: 118296596
Publisher: Springer
Year: 2004
Tongue: English
Weight: 252 KB
Volume: 14
Category: Article
ISSN: 1016-443X
DOI: 10.1007/s00039-004-0461-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramanujan

✍ MORDELL, L. J. 📂 Article 📅 1941 🏛 Nature Publishing Group 🌐 English ⚖ 625 KB

Ramanujan graphs

✍ A. Lubotzky; R. Phillips; P. Sarnak 📂 Article 📅 1988 🏛 Springer-Verlag 🌐 English ⚖ 763 KB

Srinivasa Ramanujan

✍ NEVILLE, E. H. 📂 Article 📅 1942 🏛 Nature Publishing Group 🌐 English ⚖ 522 KB

Srinivasa Ramanujan

✍ NEVILLE, E. H. 📂 Article 📅 1924 🏛 Nature Publishing Group 🌐 English ⚖ 126 KB

Interval hypergraphs and D-interval hype

Interval hypergraphs and D-interval hypergraphs

✍ John I. Moore Jr. 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 449 KB

A hypcrgraph H = ( ~,; g) is called an inler,, d hypergraph if there exists a one-try-one functio,~ [ mapping the elements of V h:~ points on the real line such that for each edge E, there is an interval !, containing the images of all elements of E, but not the images of any elements not in E,. The

Hypergraphes de Petersen! Hypergraphes d

Hypergraphes de Petersen! Hypergraphes de Moore?

✍ Jean FranÇois Maurras 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 449 KB

On &die ici des sous structures des plan projectifs finis Pg(2, n) od n est impair. Dans ceux-ci les (n + I)-arcs induisent une decomposition canonique. Soit E l'ensemble des points, D celui des droites, appelons X l'ensemble des points d'un (n + l)-arc. On obtient alors une partition de D en consid