𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some new bounds on partition critical hypergraphs

✍ Scribed by Zoltán Füredi; Attila Sali

Book ID
113582410
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
255 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New bounds on nearly perfect matchings i
New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
✍ Van H. Vu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

Let H be a k + 1 -uniform, D-regular hypergraph on n vertices and let H be the minimum number of vertices left uncovered by a matching in H. C j H , the j-codegree of H, is the maximum number of edges sharing a set of j vertices in common. We prove a general upper bound on H , based on the codegree

Some new bounds on the spectral radius o
Some new bounds on the spectral radius of matrices
✍ Qingbing Liu; Guoliang Chen; Linlin Zhao 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A new lower bound on the smallest eigenvalue τ (A B) for the Fan product of two nonsingular M-matrices A and B is given. Meanwhile, we also obtain a new upper bound on the spectral radius ρ(A • B) for nonnegative matrices A and B. These bounds improve some results of Huang (2008) [R. Huang, Some ine

Some Observations on Dyson's New Symmetr
Some Observations on Dyson's New Symmetries of Partitions
✍ Alexander Berkovich; Frank G. Garvan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 281 KB

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogs of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank 4k and those with k in the Rank-Set of partitions. Also, we extend Dyson's adjoint of a