On the Nash-Williams′ Lemma in Graph Rec
✍
B.D. Thatte
📂
Article
📅
1993
🏛
Elsevier Science
🌐
English
⚖ 382 KB
A generalization of Nash-Williams' lemma is proved for the structure of \(m\)-uniform null ( \(m-k\) )-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tourn