AMS Sectional Meeting AMS Special Session
Current as of Friday, December 21, 2018 16:24:47
Fall Central Sectional Meeting
- University of Michigan, Ann Arbor, Ann Arbor, MI
- October 20-21, 2018 (Saturday - Sunday)
- Meeting #1143
Georgia Benkart, AMS benkart@math.wisc.edu
Special Session on Probabilistic Methods in Combinatorics
-
Saturday October 20, 2018, 8:30 a.m.-11:20 a.m.
Special Session on Probabilistic Methods in Combinatorics, I
Room 1437, Mason Hall
Organizers:
Patrick Bennett, Western Michigan University
Andrzej Dudek, Western Michigan University andrzej.dudek@wmich.edu
David Galvin, University of Notre Dame
-
8:30 a.m.
Long Berge cycles and paths in dense uniform hypergraphs.
Zoltan F\" uredi, Renyi Institute of Mathematics, Budapest, Hungary
Alexandr Kostochka*, University of Illinois at Urbana-Champaign
Ruth Luo, University of Illinois at Urbana-Champaign
(1143-05-76) -
9:00 a.m.
The number of 4-colorings of the Hamming cube.
Jeff Kahn, Rutgers University
Jinyoung Park*, Rutgers University
(1143-05-116) -
9:30 a.m.
$k$-regular subgraphs near the $k$-core threshold of a random graph.
Dieter Mitsche, Universite de Nice Sophia-Antipolis
Mike Molloy, University of Toronto
Pawel Pralat*, Ryerson University
(1143-05-216) -
10:00 a.m.
Packing Edge-disjoint Spanning Trees in Random Geometric Graphs.
Pu Gao, Monash University
Xavier P\'erez-Gim\'enez*, University of Nebraska-Lincoln
Cristiane Sato, Universidade Federal do ABC
(1143-05-257) -
10:30 a.m.
Using random polynomials in extremal graph theory.
Michael Tait*, Carnegie Mellon University
(1143-05-199) -
11:00 a.m.
Coloring (random) hypergraphs.
Alan Frieze*, Carnegie Mellon University
(1143-05-212)
-
8:30 a.m.
-
Saturday October 20, 2018, 2:00 p.m.-4:20 p.m.
Special Session on Probabilistic Methods in Combinatorics, II
Room 1437, Mason Hall
Organizers:
Patrick Bennett, Western Michigan University
Andrzej Dudek, Western Michigan University andrzej.dudek@wmich.edu
David Galvin, University of Notre Dame
-
2:00 p.m.
Extremal problems for independent sets in hypergraphs.
Jacques A Verstraete*, University of California, San Diego
(1143-05-529) -
3:00 p.m.
Decomposing graphs into edges and triangles.
Daniel Kr\'al', Masaryk University in Brno
Bernard Lidick\'y*, Iowa State University
Ta\'{\i}sa L. Martins, University of Warwick
Yanitsa Pehova, University of Warwick
(1143-05-413) -
3:30 p.m.
TALK CANCELLED: A random graph process.
Adam Logan, The Tutte Institute for Mathematics and Computing
Michael Molloy*, University of Toronto
Pawel Pralat, Ryerson University
(1143-05-544) -
4:00 p.m.
Large girth approximate Steiner triple systems.
Tom Bohman*, Carnegie Mellon University
Lutz Warnke, Georgia Institute of Technology
(1143-05-531)
-
2:00 p.m.
-
Sunday October 21, 2018, 8:00 a.m.-9:20 a.m.
Special Session on Probabilistic Methods in Combinatorics, III
Room 1437, Mason Hall
Organizers:
Patrick Bennett, Western Michigan University
Andrzej Dudek, Western Michigan University andrzej.dudek@wmich.edu
David Galvin, University of Notre Dame
-
8:00 a.m.
Proportional Choosability: A New List Analogue of Equitable Coloring.
Hemanshu Kaul*, Illinois Institute of Technology
(1143-05-427) -
8:30 a.m.
Missed connections: Finding similar vertices using random walks.
Amanda E Redlich*, UMass Lowell
(1143-05-509) -
9:00 a.m.
Monochromatic structures in edge-colored bipartite graphs.
Louis DeBiasio*, Miami University
Andr\'as Gy\'arf\'as, Alfr\'ed R\'enyi Institute of Mathematics
Robert A. Krueger, Miami University
Mikl\'os Ruszink\'o, Alfr\'ed R\'enyi Institute of Mathematics
G\'abor N. S\'ark\"ozy, Worcester Polytechnic Institute and Alfr\'ed R\'enyi Institute of Mathematics
(1143-05-200)
-
8:00 a.m.
-
Sunday October 21, 2018, 1:00 p.m.-2:50 p.m.
Special Session on Probabilistic Methods in Combinatorics, IV
Room 1437, Mason Hall
Organizers:
Patrick Bennett, Western Michigan University
Andrzej Dudek, Western Michigan University andrzej.dudek@wmich.edu
David Galvin, University of Notre Dame
-
1:00 p.m.
The geometry and combinatorics of discrete line segment hypergraphs.
Deborah Oliveros, Instituto de Matematicas, Universidad Nacional Autonoma de Mexico
Christopher ONeill, San Diego State University
Shira Zerbib*, University of Michigan
(1143-05-155) -
1:30 p.m.
On Tur\'an exponents of bipartite graphs.
Tao Jiang*, Miami University
Jie Ma, University of Science and Technology of China
Liana Yepremyan, University of Oxford, UK
(1143-05-353) -
2:00 p.m.
Nearly-subadditive sequences.
Zoltan Furedi*, Renyi Institute of Mathematics, Budapest, Hungary and UIUC
Imre Ruzsa, Renyi Institute of Mathematics, Budapest, Hungary
(1143-05-420) -
2:30 p.m.
An improved lower bound for Folkman's theorem.
Jozsef Balogh*, University of Illinois at Urbana-Champaign
(1143-05-186)
-
1:00 p.m.
Inquiries: meet@ams.org