V. Gruslys

activity

20132020

most citedDecomposing the vertex set of a hypercube into isomorphic subgraphs

8 citations · 28 across the 9 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016★ 4 cited

Almost partitioning the hypercube into copies of a graph

Vytautas Gruslys, Shoham Letzter

Let $H$ be an induced subgraph of the hypercube $Q_{k}$ , for some $k$ . We show that for some $c = c (H)$ , the vertices of $Q_{n}$ can be partitioned into induced copies of $H$ and a rem…

math.CO2016★ 8 cited

Decomposing the vertex set of a hypercube into isomorphic subgraphs

Vytautas Gruslys

Let $G$ be an induced subgraph of the hypercube $Q_{k}$ for some $k$ . We show that if $∣ G ∣$ is a power of $2$ then, for sufficiciently large $n$ , the vertex set of $Q_{n}$ can be parti…

math.CO2016

Partitioning the Boolean lattice into copies of a poset

Vytautas Gruslys, Imre Leader, István Tomon

Let $P$ be a poset of size $2^{k}$ that has a greatest and a least element. We prove that, for sufficiently large $n$ , the Boolean lattice $2^{[n]}$ can be partitioned into copies of…

math.CO2016★ 2 cited

Minimising the number of triangular edges

Vytautas Gruslys, Shoham Letzter

We consider the problem of minimising the number of edges that are contained in triangles, among $n$ -vertex graphs with a given number of edges. We prove a conjecture of Füredi and…