Zobrazeno 1 - 10
of 52
pro vyhledávání: '"Keranen, Melissa"'
A maximal arc of degree k in a finite projective plane P of order q = ks is a set of (q-s+1)k points that meets every line of P in either k or 0 points. The collection of the nonempty intersections of a maximal arc with the lines of P is a resolvable
Externí odkaz:
http://arxiv.org/abs/2403.03189
The uniform Hamilton-Waterloo Problem (HWP) asks for a resolvable $(C_M, C_N)$-decomposition of $K_v$ into $\alpha$ $C_M$-factors and $\beta$ $C_N$-factors. We denote a solution to the uniform Hamilton Hamilton-Waterloo problem by $\hbox{HWP}(v; M, N
Externí odkaz:
http://arxiv.org/abs/2402.10081
Autor:
Lee, Jehyun, Keranen, Melissa
We consider the existence problem of uniformly resolvable decompositions of $K_v$ into subgraphs such that each resolution class contains only blocks isomorphic to the same graph. We give a complete solution for the case in which one resolution class
Externí odkaz:
http://arxiv.org/abs/2312.09371
Autor:
Asplund, John, Keranen, Melissa
A ${\rm{TS}}(v,\lambda)$ is a pair $(V,\mathcal{B})$ where $V$ contains $v$ points and $\mathcal{B}$ contains $3$-element subsets of $V$ so that each pair in $V$ appears in exactly $\lambda$ blocks. A $2$-block intersection graph ($2$-BIG) of a ${\rm
Externí odkaz:
http://arxiv.org/abs/1805.00535
Autor:
Keranen, Melissa, Pastine, Adrián
The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\left\lfloor\frac{v-1}{2}\right\rfloor$. If $F_{1}$ consists of $m$-cycles and $F_{
Externí odkaz:
http://arxiv.org/abs/1712.09291
Autor:
Keranen, Melissa S., Kreher, Donald L.
A partial Steiner triple system whose triples can be partitioned into $s$ partial parallel classes, each of size $m$, is a $signal$ $set$, denoted $\mbox{SS}(v,s,m)$. A $Kirkman$ $signal$ $set$ $\mbox{KSS}(v,m)$ is an $\mbox{SS}(v,s,m)$ with $s=\lflo
Externí odkaz:
http://arxiv.org/abs/1707.07282
Autor:
Keranen, Melissa, Pastine, Adrián
The Hamilton-Waterloo problem asks for which $s$ and $r$ the complete graph $K_n$ can be decomposed into $s$ copies of a given 2-factor $F_1$ and $r$ copies of a given 2-factor $F_2$ (and one copy of a 1-factor if $n$ is even). In this paper we gener
Externí odkaz:
http://arxiv.org/abs/1605.01781
Publikováno v:
Australasian Journal of Combinatorics, 64(3) (2016), 458-474
The Hamilton-Waterloo Problem (HWP) in the case of $C_{m}$-factors and $C_{n}$-factors asks if $K_v$, where $v$ is odd (or $K_v-F$, where $F$ is a 1-factor and $v$ is even), can be decomposed into r copies of a 2-factor made either entirely of $m$-cy
Externí odkaz:
http://arxiv.org/abs/1510.04607
Autor:
Keranen, Melissa, Lauri, Juho
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol. 20 no. 1, Graph Theory (June 4, 2018) dmtcs:3877
A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertice
Externí odkaz:
http://arxiv.org/abs/1405.6893
Autor:
Keranen, Melissa, Laffin, Melanie
We present constructions and results about GDDs with two groups and block size 6. We study those GDDs in which each block has configuration (s,t), that is in which each block has exactly s points from one of the two groups and t points from the other
Externí odkaz:
http://arxiv.org/abs/1105.1470