Seminar Calendar
for Women's Seminar events the year of Wednesday, July 4, 2012.

.
events for the
events containing

Questions regarding events or the calendar should be directed to Tori Corkery.
      June 2012              July 2012             August 2012
Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa   Su Mo Tu We Th Fr Sa
1  2    1  2  3  4  5  6  7             1  2  3  4
3  4  5  6  7  8  9    8  9 10 11 12 13 14    5  6  7  8  9 10 11
10 11 12 13 14 15 16   15 16 17 18 19 20 21   12 13 14 15 16 17 18
17 18 19 20 21 22 23   22 23 24 25 26 27 28   19 20 21 22 23 24 25
24 25 26 27 28 29 30   29 30 31               26 27 28 29 30 31



Friday, January 27, 2012

Women's Seminar
11:00 pm   in Altgeld Hall,  Friday, January 27, 2012
 Del Edit Copy
Submitted by funk3.
 Beginning of Semester LunchAbstract: We will have our traditional beginning of the semester lunch on Friday. We will meet in the mailroom at 11:00 am. We will walk over to the Illini Union Ballroom and be prepared to be seated as soon as they open at 11:30. In the meantime, we will have time to chat about the upcoming semester. Jane and Kelly have some ideas floating around and we'd like to get your feedback. We'll be in the Ballroom until 12:30. So, if you have class at 12:00, you can duck out early from lunch, or if you get out of class at 11:50, you can join us after your class.

Tuesday, February 7, 2012

Women's Seminar
4:00 pm   in 241 Altgeld Hall,  Tuesday, February 7, 2012
 Del Edit Copy
Submitted by funk3.
 Sogol Jahanbekam (UIUC Math)Application of Combinatorial Nullstellensatz to graph factor and the 1,2-Conjecutre; Dynamic coloring of grids; Antiramsey TheoryAbstract: I will first talk about applications of Combinatorial Nullstellensatz to graph factors, the 1,2-Conjecture, and the 1,2,3-Conjecture. I'll give some sufficient conditions for a graph to have a specified factor and sufficient conditions with respect to minimum degree and chromatic number such that the 1,2-Conjecture or the 1,2,3-conjecture hold for the graph. Next subject will be about r-dynamic coloring of grids, and finally I will introduce a future aim in Antiramsey Theory.

Friday, April 6, 2012

Women's Seminar
11:00 am   in 447 Altgeld Hall,  Friday, April 6, 2012
 Del Edit Copy
Submitted by funk3.
 Jane Butterfield (UIUC Math)Syllabus Construction for Math TA's Abstract: Do you think of your syllabus as a way to give students your contact information and the name of the textbook? As a TA, do you even think you need to hand out a syllabus? This talk will focus on the ways in which a well-written syllabus can help you avoid many common classroom problems. It will be based on the paper "The Purposes of a Syllabus", by J. Parkes and M.B. Harris, interpreted to address the specific needs of graduate students who are TA's for math department courses. We will go to lunch afterwards. If you would like to go to lunch, but can't attend the talk, please meet in the mailroom at 11:50.

Thursday, September 20, 2012

Women's Seminar
3:00 pm   in 147 Altgeld Hall,  Thursday, September 20, 2012
 Del Edit Copy
Submitted by funk3.
 Sarah Loeb and Sogol Jahanbekam (UIUC Math)Combinatorics at MightyAbstract: Results in Chromatic-Paintability and the Paintability of Complete Bipartite Graphs by Sarah Loeb Introduced independently by Schauz and by Zhu, the Marker-Remover game is an on-line version of list coloring. The game is played on a graph $G$ with a token assignment $f$ giving each $v \in V(G)$ a nonnegative number of tokens. On each round Marker marks a subset $M$ of the remaining vertices, which uses up a token on each vertex in $M$. Remover deletes from the graph an independent subset of vertices in $M$. Marker wins by marking a vertex that has no tokens. Remover wins if the entire graph is removed. The paint number, or paintability, of a graph $G$ is the least $k$ such that Remover has a winning strategy when $f(v) = k$ for all $v \in V(G)$. We show that if $G$ is $k$-paintable and $|V(G)| \le \frac{t}{t-1} k$, then the join of $G$ with $\overline{K}_t$ is $(k+1)$-paintable. As a corollary, the paint number of $G$ equals to its chromatic number when $|V(G)| \le \chi(G) + 2 \sqrt{\chi(G)-1}$. This strengthens a result of Ohba. We also explore the paintability of complete bipartite graphs. Extending a result of Erd\H{o}s, Rubin, and Taylor, $K_{k,r}$ is $k$-paintable if and only if $r < k^k$. For $j \ge 1$ we provide an upper bound on the least $r$ such that $K_{k+j,r}$ is not $k$-paintable. 1,2,3-Conjecture and 1,2-Conjecture for sparse graphs by Sogol Jahanbekam We apply the Discharging Method to prove the 1, 2, 3-Conjecture and the 1, 2-Conjecture for graphs with maximum average degree less than 8 3. As a result, the conjectures hold for planar graphs with girth at least 8.

Thursday, November 8, 2012