A note on polynomials and \(f\)-factors of graphs
The electronic journal of combinatorics, Tome 15 (2008)
Let $G = (V,E)$ be a graph, and let $f : V \rightarrow 2^{\Bbb Z}$ be a function assigning to each $v \in V$ a set of integers in $\{0,1,2,\dots,d(v)\}$, where $d(v)$ denotes the degree of $v$ in $G$. Lovász defines an $f$-factor of $G$ to be a spanning subgraph $H$ of $G$ in which $d_{H}(v) \in f(v)$ for all $v \in V$. Using the combinatorial nullstellensatz of Alon, we prove that if $|f(v)| > \lceil {1\over 2}d(v) \rceil$ for all $v \in V$, then $G$ has an $f$-factor. This result is best possible and verifies a conjecture of Addario-Berry, Dalal, Reed and Thomason.
@article{10_37236_897,
author = {Hamed Shirazi and Jacques Verstra\"ete},
title = {A note on polynomials and \(f\)-factors of graphs},
journal = {The electronic journal of combinatorics},
year = {2008},
volume = {15},
doi = {10.37236/897},
zbl = {1160.05329},
url = {http://geodesic.mathdoc.fr/articles/10.37236/897/}
}
Hamed Shirazi; Jacques Verstraëte. A note on polynomials and \(f\)-factors of graphs. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/897
Cité par Sources :