On deficiency problems for graphs

DOI10.1017/S0963548321000389MaRDI QIDQ5886330zbMATH OpenFDO

Authors Andrea Freschi, Joseph Hyde, Andrew Treglown

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 theoremsclique factorsgraph deficiency

Mathematics Subject Classification ID

Triple systems (05B07) Orthogonal arrays, Latin squares, Room squares (05B15) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Completion and deficiency problems
• Further results on the deficiency of graphs
• Minimum number of vertices of almost 3-regular graphs with given deficiency
• scientific article; zbMATH DE number 91006
• Spectral conditions for graphs to be \(\beta\)-deficient involving minimum degree

Cites work

• A partial Steiner triple system of order n can be embedded in a Steiner triple system of order 6n + 3
• A proof of Lindner's conjecture on embeddings of partial Steiner triple systems
• Completing partial packings of bipartite graphs
• Completion and deficiency problems
• Embedding spanning bipartite graphs of small bandwidth
• scientific article; zbMATH DE number 3887704 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• On Hamilton's ideals
• On the size of graphs with complete-factors
• Proof of the bandwidth conjecture of Bollobás and Komlós
• The minimum degree threshold for perfect graph packings
• Tight embeddings of partial quadrilateral packings

Cited in

(5)

• Some defective parameters in graphs
• Completion and deficiency problems
• On the König deficiency of zero-reducible graphs
• scientific article; zbMATH DE number 91036 (Why is no real title available?)
• On sufficient conditions for spanning structures in dense graphs

This page was built for publication: On deficiency problems for graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886330)