On deficiency problems for graphs

DOI10.1017/S0963548321000389MaRDI QIDQ5886330

Andrew Treglown, Joseph Hyde, Andrea Freschi

Publication date: 31 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.04389

zbMATH Keywords

bandwidth theorems; clique factors; graph deficiency

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05B15: Orthogonal arrays, Latin squares, Room squares

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

05B07: Triple systems