𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Observables on hypergraphs

✍ Scribed by S. P. Gudder; G. T. Rüttimann

Publisher
Springer US
Year
1986
Tongue
English
Weight
834 KB
Volume
16
Category
Article
ISSN
0015-9018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Turan hypergraphs
On Turan hypergraphs
✍ M. Lorea 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Let a(H) be the -,t\*rbility number of a hypergraph H = (X, a). T(n, L, ar) is the smallest 4 such that there exists :'. k-uniform hypergraph H with n vertices, 4 edges and with a(H) s Q. A k-uniform hypergraph H, with n vertices, T( n, k, cr ) edges and Q!(H) s ~1 is a Turan hypergraph. The value

On unavoidable hypergraphs
On unavoidable hypergraphs
✍ F. R. K. Chung; P. Erdös 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 518 KB
Constraints on spin observables
Constraints on spin observables
✍ Jean-Marc Richard; Xavier Artru; Mokhtar Elchikh; Jacques Soffer; Oleg Teryaev 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 566 KB
On decomposing a hypergraph into k conne
On decomposing a hypergraph into k connected sub-hypergraphs
✍ András Frank; Tamás Király; Matthias Kriesell 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 159 KB

By applying the matroid partition theorem of J. Edmonds (J. Res. Nat. Bur. Standards Sect. B 69 (1965) 67) to a hypergraphic generalization of graphic matroids, due to Lorea (Cahiers Centre Etudes Rech. Oper. 17 (1975) 289), we obtain a generalization of Tutte's disjoint trees theorem for hypergraph