most citedAlmost partitioning the hypercube into copies of a graph

4 citations · 4 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2024

Building graphs with high minimum degree on a budget

Kyriakos Katsamaktsis, Shoham Letzter

We consider the problem of constructing a graph of minimum degree in the following controlled random graph process, introduced recently by Frieze, Krivelevich and Michaeli…

math.CO2023

Ascending Subgraph Decomposition

Kyriakos Katsamaktsis, Shoham Letzter, Alexey Pokrovskiy +1

A typical theme for many well-known decomposition problems is to show that some obvious necessary conditions for decomposing a graph into copies are also suf…

math.CO2016★ 4 cited

Almost partitioning the hypercube into copies of a graph

Vytautas Gruslys, Shoham Letzter

Let be an induced subgraph of the hypercube , for some . We show that for some , the vertices of can be partitioned into induced copies of and a rem…