arXiv Analytics

Sign in

arXiv:1805.00535 [math.CO]AbstractReferencesReviewsResources

Hamiltonicity of $2$-block intersection graphs of ${\rm{TS}}(v,λ)$: $v\equiv 0$ or $4\pmod{12}$

John Asplund, Melissa Keranen

Published 2018-05-01Version 1

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{TS}}(v,\lambda)$ is a graph where each vertex is represented by a block from the ${\rm{TS}}(v,\lambda)$ and each pair of blocks $B_i,B_j\in \mathcal{B}$ are joined by an edge if $|B_i\cap B_j|=2$. Using constructions for ${\rm{TS}}(v,\lambda)$ given by Schreiber, we show that there exists a ${\rm{TS}}(v,\lambda)$ for $v\equiv 0$ or $4\pmod{12}$ whose $2$-BIG is Hamiltonian.

Comments: 19 pages, 23 figures
Categories: math.CO
Subjects: 05C45, 05C51
Related articles: Most relevant | Search more
arXiv:1201.5707 [math.CO] (Published 2012-01-27, updated 2013-11-13)
Hamiltonicity of 3-arc graphs
arXiv:1610.06558 [math.CO] (Published 2016-10-20)
Hamiltonicity of planar graphs with a forbidden minor
arXiv:1810.07719 [math.CO] (Published 2018-10-17)
Further Results on Existentially Closed Graphs Arising from Block Designs