Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Sarada Herke"'
Publikováno v:
Journal of Combinatorial Theory, Series B. 135:1-15
We prove that a complete multipartite graph K with n > 1 vertices and m edges can be decomposed into edge-disjoint Hamilton paths if and only if m n − 1 is an integer and the maximum degree of K is at most 2 m n − 1 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4999b853d2303676d39c8c4b1530cc8
https://doi.org/10.1016/j.jctb.2018.07.006
https://doi.org/10.1016/j.jctb.2018.07.006
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
Autor:
Barbara Maenhaut, Sarada Herke
Publikováno v:
Journal of Combinatorial Designs. 23:369-399
A 1-factorization of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchings), and a perfect 1-factorization is a 1-factorization in which the union of any two of the 1-factors is a Hamilton cycle. We consider the problem of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47f27061782b518f124d848c5d9483e3
https://doi.org/10.1002/jcd.21399
https://doi.org/10.1002/jcd.21399
Publikováno v:
Discrete Mathematics. 311(13):1235-1246
A broadcast on a graph G is a function f:V->Z^+@?{0}. The broadcast number of G is the minimum value of @?"v"@?"Vf(v) among all broadcasts f for which each vertex of G is within distance f(v) from some vertex v with f(v)>=1. This number is bounded ab
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07f094744bec7c17f2298e7332d2df04
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
Autor:
Sarada Herke
A 1-factorisation of a graph G is a decomposition of G into edge-disjoint 1-factors (1-regular spanning subgraphs). A perfect 1-factorisation is a 1-factorisation in which the union of every pair of distinct 1-factors is a Hamilton cycle; a 1-factori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5c60f5cb29667e3152ff39ae7ef4e462
https://doi.org/10.14264/uql.2014.98
https://doi.org/10.14264/uql.2014.98
Autor:
Sarada Herke, Barbara Maenhaut
Publikováno v:
The Electronic Journal of Combinatorics. 20
A $1$-factorisation of a graph $G$ is a decomposition of $G$ into edge-disjoint $1$-factors (perfect matchings), and a perfect $1$-factorisation is a $1$-factorisation in which the union of any two of the $1$-factors is a Hamilton cycle. We consider
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88222da7ecbaa1bb0c64c9cc82d04e1f
https://doi.org/10.37236/2264
https://doi.org/10.37236/2264
Publikováno v:
The Electronic Journal of Combinatorics. 17
We prove a result concerning the possible orders of a basis for the cyclic group ${\Bbb Z}_n$, namely: For each $k \in {\Bbb N}$ there exists a constant $c_k > 0$ such that, for all $n \in {\Bbb N}$, if $A \subseteq {\Bbb Z}_n$ is a basis of order gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2c90bf59d58676abaca5621af9da2651
https://doi.org/10.37236/351
https://doi.org/10.37236/351
Publikováno v:
Journal of Graph Theory. Jul2018, Vol. 88 Issue 3, p434-448. 15p.