@inbook{7b4ab990e81d449aaab04d88d764fabc,
title = "Switching techniques for edge decompositions of graphs",
abstract = "This article concerns a class of techniques, herein referred to as edge switching techniques, that enable a new edge decomposition to be obtained from an existing one by interchanging edges between the subgraphs in the decomposition. These techniques can be viewed as generalisations of classical path switching methods for proper edge colourings. Their use in other edge decomposition settings dates back at least to 1980, but the last ten years have seen them rapidly developed and employed to resolve Lindner's conjecture on embedding partial Steiner triple systems, Alspach's cycle decomposition problem, and numerous other questions. Here we aim to give the reader a gentle introduction to these techniques and to some of their most significant applications beyond edge colouring.",
author = "Daniel Horsley",
year = "2017",
month = jun,
day = "30",
doi = "10.1017/9781108332699",
language = "English",
series = "London Mathematical Society Lecture Note Series",
publisher = "Cambridge University Press",
pages = "238--271",
editor = "Anders Claesson and Mark Dukes and Sergey Kitaev and David Manlove and Kitty Meeks",
booktitle = "Surveys in Combinatorics 2017",
address = "United Kingdom",
}