𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large antipodal families

✍ Scribed by Balázs Csikós; György Kiss; Konrad J. Swanepoel; P. Oloff de Wet


Book ID
106454387
Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
225 KB
Volume
58
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


cover
✍ McNab, Claire 📂 Fiction 📅 2002 🏛 KTM Editions 🌐 French ⚖ 93 KB 👁 1 views

La rencontre entre Lee, la brillante femme d'affaires et Alex, la jeune déléguée chargée de l'accueillir avait tout pour rester strictement professionnelle, mais peu à peu, l'attirance se fait insidieuse et met à rude épreuve leurs inhibitions et leurs lignes Dans le décor paradisiaque des côtes aus

On antipodal graphs
✍ R. Aravamudhan; B. Rajendran 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 108 KB

The antipodal graph of a graph G, denoted by A(G), is the graph on the same vertices as of G, two vertices being adjacent if the distance between them is equal to the diameter of G. A graph is said to be antipodal if it is the antipodal graph A (I4) of some graph H. We give a necessary and sufficien

Antipodal covering graphs
✍ A Gardiner 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 937 KB
Antipode Online
✍ Noel Castree; Melissa Wright 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 470 KB
The antipodal layers problem
✍ Glenn Hurlbert 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 481 KB

For n > 2k and [n] = { 1,2, . . , n}, let the bipartite graph 4,t have vertices {A c [n] 1) A I= k or n-k) and edges {(A, B)j A c B}. It has been conjectured that Ask+ I,t (the middle two levels of the Boolean lattice .!!2z"f') is Hamiltonian, and we conjecture the same for arbitrary n. Here we show