Browse by Author "Kantor, Ida"

  • Kantor, Ida (2011-01-14)
    \noindent{This thesis focuses on topics in extremal combinatorics.} Given an integer-valued function $f$ defined on the vertices of a graph $G$, we say $G$ is {\em $f$-choosable} if for every collection of lists with ...

    application/pdf

    application/pdfPDF (588Kb)