Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-the-covering-number-c-3-w-4-3-v-opkDB54cvd
References (17)
-
C. Lindner, C. Rodger (2008)
Steiner Quadruple Systems -
Mark Fischer, M. Sigrist (2008)
Dimensional crossover in Sr2RuO4 within a slave-boson mean-field theoryEPL (Europhysics Letters), 85
-
C. Berge (1989)
Hypergraphs: Combinatorics of Finite Sets -
A. Hartman (1994)
The fundamental construction for 3-designsDiscret. Math., 124
-
A. Hartman, K.T. Phelps (1992)
Contemporary Design Theory -
Y. Wu, T. Feng (2009)
On the minimum covering problem of MC λ = (3,K 4 (3) −e, v)J. Beijing Jiaotong University, 33
-
Hedvig Mohácsy, D. Ray-Chaudhuri (2002)
Candelabra systems and designsJournal of Statistical Planning and Inference, 106
-
Yan Wu, Yanxun Chang (2014)
On the maximum packing problem of MPλ(3, K(3)4 - e, v)Ars Comb., 113
-
Y. Wu, Y. Chang (2009)
Determination of the packing number D λ = (3,W 4 (3) , v)Science in China Series A, 52
-
Yan Wu, Yanxun Chang (2009)
Determination of the packing number Dλ(3,W4(3),ν)Science in China Series A: Mathematics, 52
-
H. Hanani (1963)
On Some Tactical ConfigurationsCanadian Journal of Mathematics, 15
-
G. Crescenzo, Clemente Galdi (2003)
Hypergraph decomposition and secret sharingDiscret. Appl. Math., 157
-
Wu Yan (2010)
Decompositions of the 3-uniform Hypergraphs K_v~(3)into Hypergraphs of a Certain TypeScience Technology and Engineering
-
Feng Tao (2009)
On the Minimum Covering Problem of MC_λ(3,_4~((3))-e,v)Journal of Beijing Jiaotong University
-
T. Feng, Y. Chang (2007)
Decompositions of the 3-uniform hypergraphs K(3) v into hypergraphs of a certain typeScience in China Series A: Mathematics, 50
-
(1974)
On the covering of triples by quadruples -
T. Beth, D. Jungnickel, H. Lenz (1999)
Design Theory
- Publisher
- Springer Journals
- Copyright
- Copyright © 2012 by Institute of Applied Mathematics, Academy of Mathematics and System Sciences, Chinese Academy of Sciences and Springer-Verlag Berlin Heidelberg
- Subject
- Mathematics; Applications of Mathematics; Theoretical, Mathematical and Computational Physics; Math Applications in Computer Science
- ISSN
- 0168-9673
- eISSN
- 1618-3932
- DOI
- 10.1007/s10255-012-0178-y
- Publisher site
- See Article on Publisher Site
Abstract
A t-hyperwheel (t ≥ 3) of length l (or W l (t) for brevity) is a t-uniform hypergraph (V,E), where E = {e 1, e 2, …, e l } and v 1, v 2, …, v l are distinct vertices of $V = \bigcup\limits_{i = 1}^l {e_i } $ such that for i = 1, …, l, v i , v i +1 ∈ e i and e i ∩ e j = P, j ∋ {i − 1, i, i + 1}, where the operation on the subscripts is modulo l and P is a vertex of V which is different from v i , 1 ≤ i ≤ l. In this paper, the minimum covering problem of MC λ (3,W 4 (3) , v) is investigated. Direct and recursive constructions on MC λ (3,W 4 (3) , v) are presented. The covering number c λ (3,W 4 (3) , v) is finally determined for any positive integers v ≥ 5 and λ.
Journal
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Nov 21, 2012