A Note on Set Systems with no Union of Cardinality 0 modulo m
\emphAlon, Kleitman, Lipton, Meshulam, Rabin and \emphSpencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph \textbf\textitF=\F_1,F_2,\ldots, F_d(q-1)+1\, where q is a prime-power, and d denotes the maximal degree of the hypergraph, there exists an \textbf\textitF_0⊂ \textb...
Main Author: | Vince Grolmusz |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2003-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/341/pdf |
Similar Items
-
Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01) -
A note on compact and compact circular edge-colorings of graphs
by: Dariusz Dereniowski, et al.
Published: (2008-01-01) -
A note on planar Ramsey numbers for a triangle versus wheels
by: Guofei Zhou, et al.
Published: (2012-11-01) -
On economical set representations of graphs
by: Jing Kong, et al.
Published: (2009-01-01) -
Sufficient conditions for labelled 0-1 laws
by: Stanley N. Burris, et al.
Published: (2008-01-01)