|
|
|
Elementary proofs are presented for two graph theoretic results, originally proved by H. Shirazi and J. Verstraëte using the combinatorial Nullstellensatz.
Bibtex entry:
| AUTHOR | = | {Frank, Andr{\'a}s and Lau Chi, Lap and Szab{\'o}, J{\'a}cint}, |
| TITLE | = | {A note on degree-constrained subgraphs}, |
| NOTE | = | {{\tt www.cs.elte.hu/egres}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2006}, |
| NUMBER | = | {QP-2006-05} |