Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Nevena Francetić"'
Autor:
Nevena Francetić, Brett Stevens
Publikováno v:
Journal of Combinatorial Designs. 25:243-257
A covering array CA (N;t,k,v) is an N×k array A such that each cell of A takes a value from a v-set V, which is called the alphabet. Moreover, the set Vt is contained in the set of rows of every N×t subarray of A. The parameter N is called the size
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43a3229ce394206dab9b7871fc392eb8
https://doi.org/10.1002/jcd.21553
https://doi.org/10.1002/jcd.21553
Publikováno v:
Linear Algebra and its Applications. 487:43-73
A $(v,k,\lambda)$-covering is a pair $(V, \mathcal{B})$, where $V$ is a $v$-set of points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ (called blocks), such that every unordered pair of points in $V$ is contained in at least $\lambda$ bloc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb8586a0c9e513d2395330fb30faecc4
https://doi.org/10.1016/j.laa.2015.09.006
https://doi.org/10.1016/j.laa.2015.09.006
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin squares to s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e38d6b54c7165115aacd3c75de7e009
http://arxiv.org/abs/1703.04764
http://arxiv.org/abs/1703.04764
Publikováno v:
Discrete Applied Mathematics. 170:33-45
In graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. Various problems arise, such as determining the minimum number of brushes that are required to clean the entire graph. This number is called the brushing num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8fae67e06d5081935f7be724327ebe49
https://doi.org/10.1016/j.dam.2014.01.024
https://doi.org/10.1016/j.dam.2014.01.024
Publikováno v:
Journal of Combinatorial Designs. 21:311-341
A k-GDCD, group divisible covering design, of type is a triple , where V is a set of gu elements, is a partition of V into u sets of size g, called groups, and is a collection of k-subsets of V, called blocks, such that every pair of elements in V is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b08eb6882f44c63e62891be39e294e5c
https://doi.org/10.1002/jcd.21324
https://doi.org/10.1002/jcd.21324
Autor:
Mateja Šajna, Nevena Francetić
Publikováno v:
Discrete Mathematics. 309(10):3106-3112
A graph X is called almost self-complementary if it is isomorphic to one of its almost complements X^c-I, where X^c denotes the complement of X and I a perfect matching (1-factor) in X^c. If I is a perfect matching in X^c and @f:X->X^c-I is an isomor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9083e9559363f633a5ec027c62a30601
Autor:
Eric Mendelsohn, Nevena Francetić
Publikováno v:
Mathematica Slovaca. 59:39-76
Let D be a set of positive integers. A Skolem-type sequence is a sequence of i ∈ D such that every i ∈ D appears exactly twice in the sequence at positions a i and b i , and |b i − a i | = i. These sequences might contain empty positions, which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0043897ce688342d77a05aa9c5545eb6
https://doi.org/10.2478/s12175-008-0110-3
https://doi.org/10.2478/s12175-008-0110-3
Ryser conjectured that $\tau\le(r-1)\nu$ for $r$-partite hypergraphs, where $\tau$ is the covering number and $\nu$ is the matching number. We prove this conjecture for $r\le9$ in the special case of linear intersecting hypergraphs, in other words wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b2266645bb617e1c102c1adda87a5692