Final Program and Abstracts vid Eppstein from SIDMA 24-4 , Da or Chepoi, Hans-Juergen Bandelt or Chepoi, Vict June 16-19, 2014 Hyatt Regency Minneapolis Minneapolis, Minnesota, USA Figure courtesy Figure

Sponsored by the SIAM Activity Group on Discrete Mathematics

The SIAG on Discrete Mathematics focuses on combinatorics, graph theory, cryptography, discrete optimization, mathematical programming, coding theory, information theory, game theory, and theoretical computer science, including algorithms, complexity, circuit design, robotics, and parallel processing. This activity group provides an opportunity to unify pure discrete mathematics and areas of applied research such as computer science, operations research, combinatorics, and the social sciences. It organizes a biennial conference on discrete mathematics; co-sponsors, with ACM SIGACT, the annual Symposium on Discrete Algorithms; and sponsors minisymposia at SIAM meetings and conferences. The activity group also runs DM-Net, an electronic forum; publishes an electronic newsletter; and maintains a website and a member directory.

Society for Industrial and Applied Mathematics 3600 Market Street, 6th Floor Philadelphia, PA 19104-2688 USA Telephone: +1-215-382-9800 Fax: +1-215-386-7999 Conference E-mail: [email protected] Conference Web: www.siam.org/meetings/ Membership and Customer Service: (800) 447-7426 (US & Canada) or +1-215-382-9800 (worldwide)

www.siam.org/meetings/dm14 2 2014 SIAM Conference on Discrete Mathematics

Table of Contents SIAM Registration Desk Child Care The SIAM registration desk is located in The Hyatt Regency Minneapolis Program-at-a-Glance...... Fold out section the Greenway Promenade - 2nd Floor. It recommends Nanny Professionals, a General Information...... 2 is open during the following hours: local child care service. They can be reached at 651-221-0587, by fax at 651- Get-togethers...... 4 Sunday, June 15 Invited Plenary Presentations ...... 5 483-9261 or by e-mail at nannypro@ 5:00 PM - 8:00 PM bevcomm.net. Prize Lecture...... 7 Program Schedule...... 9 Monday, June 16 Corporate Members Abstracts...... 35 7:30 AM - 3:45 PM and Affiliates Speaker and Organizer Index...... 87 SIAM corporate members provide Conference Budget...... Inside Back cover Tuesday, June 17 their employees with knowledge about, Hotel Meeting Room Map...... Back cover access to, and contacts in the applied 8:15 AM - 3:45 PM mathematics and computational sciences community through their membership Wednesday, June 18 benefits. Corporate membership is more Organizing Committee Chair 8:15 AM - 3:45 PM than just a bundle of tangible products Bojan Mohar and services; it is an expression of Simon Fraser University, Canada support for SIAM and its programs. Thursday, June 19 SIAM is pleased to acknowledge its 7:45 AM - 3:15 PM corporate members and sponsors. Organizing Committee In recognition of their support, non- Mireille Bousquet-Mélou member attendees who are employed by CNRS, Université de Bordeaux, France Hotel Address the following organizations are entitled Maria Chudnovsky Hyatt Regency Minneapolis to the SIAM member registration rate. Columbia University, USA 1300 Nicollet Mall Minneapolis, MN 55403 Alan Frieze Carnegie Mellon University, USA Direct Telephone: +1-612-370-1234 Corporate Institutional Reservations Telephone: Members Michel Goemans +1-402-592-6464 Massachusetts Institute of Technology, USA Toll Free Reservations The Aerospace Corporation Jiri Matousek (USA and Canada): +1-800-233-1234 Air Force Office of Scientific Research Charles University, Czech Republic and ETH Group Reservations: +1-800-421-1442 AT&T Laboratories - Research Zurich, Switzerland Fax: +1-612-596-4639 Daniel A. Spielman Hotel web address: http://minneapolis. Bechtel Marine Propulsion Laboratory Yale University, USA hyatt.com/en/hotel/home.html The Boeing Company Terence Tao CEA/DAM University of California, Los Angeles, USA Department of National Defence (DND/ Robin Thomas CSEC) Georgia Institute of Technology, USA Hotel Telephone Number DSTO- Defence Science and To reach an attendee or leave a message, Technology Organisation call +1-612-370-1234. If the attendee is a hotel guest, the hotel operator can Hewlett-Packard connect you with the attendee’s room. IBM Corporation IDA Center for Communications Research, La Jolla Hotel Check-in IDA Center for Communications and Check-out Times Research, Princeton Check-in time is 3:00 PM and check-out Institute for Computational and time is 12:00 PM. Experimental Research in Mathematics (ICERM) Institute for Defense Analyses, Center for Computing Sciences Lawrence Berkeley National Laboratory 2014 SIAM Conference on Discrete Mathematics 3

Lockheed Martin substantial discounts on SIAM books, Standard Audio/Visual Los Alamos National Laboratory journal subscriptions, and conference Set-Up in Meeting Rooms registrations. Mathematical Sciences Research SIAM does not provide computers for Institute If you are not a SIAM member and paid any speaker. When giving an electronic the Non-Member or Non-Member presentation, speakers must provide their Max-Planck-Institute for Dynamics of Mini Speaker/Organizer rate to attend the Complex Technical Systems own computers. SIAM is not responsible conference, you can apply the difference for the safety and security of speakers’ Mentor Graphics between what you paid and what a computers. member would have paid ($130 for a National Institute of Standards and The Plenary Session Room will have Technology (NIST) Non-Member and $65 for a Non-Member Mini Speaker/Organizer) towards a two (2) screens, one (1) data projector National Security Agency (DIRNSA) SIAM membership. Contact SIAM and one (1) overhead projector. Cables Oak Ridge National Laboratory, Customer Service for details or join at or adaptors for Apple computers are not managed by UT-Battelle for the the conference registration desk. supplied, as they vary for each model. Department of Energy Please bring your own cable/adaptor if using an Apple computer. Sandia National Laboratories If you are a SIAM member, it only costs All other concurrent/breakout rooms Schlumberger-Doll Research $10 to join the SIAM Activity Group on will have one (1) screen and one (1) Tech X Corporation Discrete Mathematics (SIAG/DM). As data projector. Cables or adaptors for U.S. Army Corps of Engineers, Engineer a SIAG/DM member, you are eligible Apple computers are not supplied, as Research and Development Center for an additional $10 discount on this they vary for each model. Please bring conference, so if you paid the SIAM United States Department of Energy your own cable/adaptor if using an Apple member rate to attend the conference, computer. Overhead projectors will be you might be eligible for a free SIAG/ provided only if requested. List current May 2014. DM membership. Check at the registration desk. If you have questions regarding Funding Agencies availability of equipment in the meeting Free Student Memberships are available room of your presentation, or to request SIAM and the Conference Organizing to students who attend an institution that an overhead projector for your session, Committee wish to extend their thanks is an Academic Member of SIAM, are please see a SIAM staff member at the and appreciation to the U.S. National members of Student Chapters of SIAM, registration desk. Science Foundation for its support of this or are nominated by a Regular Member conference. of SIAM. E-mail Access Join onsite at the registration desk, go to SIAM attendees booked within the SIAM www.siam.org/joinsiam to join online or room block will have complimentary download an application form, or contact wireless internet access in their guest SIAM Customer Service: rooms. Complimentary wireless internet Leading the applied Telephone: +1-215-382-9800 access in the hotel lobby will also be available. Additionally, complimentary mathematics community... (worldwide); or 800-447-7426 (U.S. and Canada only) wireless internet access will be available Join SIAM and save! in the conference meeting space. This Fax: +1-215-386-7999 Leading the applied mathematics service is being provided at no additional community . . . E-mail: [email protected] cost to attendees. SIAM members save up to $130 on Postal mail: Society for Industrial and SIAM will also provide a limited number full registration for the 2014 SIAM Applied Mathematics, 3600 Market of email stations for attendees during Conference on Discrete Mathematics! Street, 6th floor, Philadelphia, PA registration hours. Join your peers in supporting the 19104-2688 USA premier professional society for applied mathematicians and computational scientists. SIAM members receive subscriptions to SIAM Review, SIAM News and Unwrapped, and enjoy 4 2014 SIAM Conference on Discrete Mathematics

Registration Fee Includes Comments? • Admission to all technical sessions Comments about SIAM meetings are • Business Meeting (open to SIAG/DM encouraged! Please send to: members) Cynthia Phillips, SIAM Vice President • Coffee breaks daily for Programs ([email protected]). • Room set-ups and audio/visual equipment Get-togethers • Welcome Reception • Welcome Reception Sunday, June 15 Job Postings 6:00 PM – 8:00 PM Please check with the SIAM registration desk regarding the availability of job postings or visit http://jobs.siam.org. • Business Meeting (open to SIAG/DM members) Tuesday, June 17 SIAM Books and Journals 5:50 PM – 6:50 PM Display copies of books and Complimentary beer and wine will complimentary copies of journals are be served. available on site. SIAM books are available at a discounted price during the conference. If a SIAM books Please Note representative is not available, completed order forms and payment (credit cards SIAM is not responsible for the safety are preferred) may be taken to the SIAM and security of attendees’ computers. registration desk. The books table will Do not leave your laptop computers close at 1:30 PM on Thursday, June 19. unattended. Please remember to turn off your cell phones, pagers, etc. during sessions. Tabletop Displays Elsevier Recording of Presentations SIAM Audio and video recording of presentations at SIAM meetings Conference Sponsors is prohibited without the written permission of the presenter and SIAM. Participant Support

Social Media SIAM is promoting the use of social media, such as Facebook and Twitter, in order to enhance scientific discussion at its meetings and enable attendees to connect with each other prior to, during and after conferences. If you are tweeting about a conference, please use the designated hashtag to enable Name Badges other attendees to keep up with the A space for emergency contact Twitter conversation and to allow better information is provided on the back of archiving of our conference discussions. your name badge. Help us help you in The hashtag for this meeting is the event of an emergency! #SIAMDM14. 2014 SIAM Conference on Discrete Mathematics 5

Invited Plenary Sessions ** All Invited Plenary Presentations will take place in Greenway C-H **

Monday, June 16 8:45 AM - 9:30 AM IP1 The Graph Regularity Method Jacob Fox, Massachusetts Institute of Technology, USA

2:00 PM - 2:45 PM IP2 Rota’s Conjecture Jim Geelen, University of Waterloo, Canada

Tuesday, June 17 8:45 AM - 9:30 AM IP3 Covering Systems of Congruences Robert Hough, Oxford University, United Kingdom

2:00 PM - 2:45 PM IP4 Submodular Functions and Their Applications Jan Vondrak, IBM Almaden Research Center, USA 6 2014 SIAM Conference on Discrete Mathematics

Invited Plenary Sessions ** All Invited Plenary Presentations will take place in Greenway C-H **

Wednesday, June 18 8:45 AM - 9:30 AM IP5 Approximation Algorithms Via Matrix Covers Noga Alon, Tel Aviv University, Israel

2:00 PM - 2:45 PM IP6 Interlacing Families and Kadison--Singer Adam Marcus, Yale University, USA

Thursday, June 19 8:15 AM - 9:00 AM IP7 Hamilton Decompositions of Graphs and Digraphs Daniela Kuhn, University of Birmingham, United Kingdom

1:30 PM - 2:15 PM IP8 The Complexity of Graph and Hypergraph Expansion Problems Santosh Vempala, Georgia Institute of Technology, USA 2014 SIAM Conference on Discrete Mathematics 7

Hot Topic Session ** The Hot Topic Session will take place in Greenway C-H **

Monday, June 16 8:00 PM - 9 PM

Hot Topic Session: The Existence of Designs Peter Keevash, University of Oxford, United Kingdom

Prize Lecture ** The Prize Lecture will take place in Greenway C-H **

Wednesday, June 18 8:00 PM - 8:45 PM

SP1 2014 Dénes König Prize Lecture – The Number of Ks,t -free Graphs Wojciech Samotij, Tel Aviv University, Israel 8 2014 SIAM Conference on Discrete Mathematics

SIAM Activity Group on Discrete Mathematics (SIAG/DM) www.siam.org/activity/dm A GREAT WAY TO GET INVOLVED! Collaborate and interact with mathematicians and applied scientists whose work involves discrete mathematics.

ACTIVITIES INCLUDE: • Special sessions at SIAM Annual Meetings

• Biennial conference on discrete mathematics vid Eppstein from SIDMA 24-4 • Co-sponsor with ACM SIGACT of the annual , Da ACM-SIAM Symposium on Discrete Algorithms • Dénes König Prize • DM-Net

• Website Hans-Juergen Bandelt or Chepoi, Vict June 16-19, 2014 Hyatt Regency Minneapolis BENEFITS OF SIAG/DM membership: Minneapolis, Minnesota, USA Figure courtesy Figure • Listing in the SIAG’s online membership directory • Additional $10 discount on registration at the SIAM Conference on Discrete Mathematics (excludes student) • Electronic communications about recent developments in your specialty • Eligibility for candidacy for SIAG/DM office • Participation in the selection of SIAG/DM officers

ELIGIBILITY: • Be a current SIAM member.

COST: • $10 per year • Student members can join two activity groups for free!

2014-15 SIAG/DM OFFICERS • Chair: Doug West, University of Illinois • Vice-Chair: Lenore Cowen, Tufts University • Program Director: Guantao Chen, Georgia State University • Secretary: Rick Brewster, Thompson Rivers University

TOTO JOINJOIN: SIAG/DM: my.siam.org/forms/join_siag.htm SIAM: www.siam.org/joinsiam 2014 SIAM Conference on Discrete Mathematics 9

DM14 Pogram vid Eppstein from SIDMA 24-4 , Da or Chepoi, Hans-Juergen Bandelt or Chepoi, Vict June 16-19, 2014 Hyatt Regency Minneapolis Minneapolis, Minnesota, USA Figure courtesy Figure 10 2014 SIAM Conference on Discrete Mathematics

Sunday, June 15 Monday, June 16 Monday, June 16 IP1 The Graph Regularity Registration Registration Method 7:30 AM-3:45 PM 5:00 PM-8:00 PM 8:45 AM-9:30 AM Room:Greenway Promenade Room:Greenway Promenade Room:Greenway C-H Chair: David Conlon, University of Oxford, United Kingdom Opening Remarks Welcome Reception Szemerédi’s regularity lemma is one 6:00 PM-8:00 PM 8:30 AM-8:45 AM of the most powerful tools in graph Room:Greenway Promenade Room:Greenway C-H theory, with many applications in combinatorics, number theory, discrete geometry, and theoretical computer science. Roughly speaking, it says that every large graph can be partitioned into a small number of parts such that the bipartite subgraph between almost all pairs of parts is random-like. Several variants of the regularity lemma have since been established with many further applications. I will discuss recent progress in understanding the quantitative aspects of these lemmas and their applications. Jacob Fox Massachusetts Institute of Technology, USA

Coffee Break 9:30 AM-10:00 AM Room:Greenway Promenade 2014 SIAM Conference on Discrete Mathematics 11

Monday, June 16 Monday, June 16 Monday, June 16 MS1 MS2 MS3 Extremal Graph Theory - Combinatorics and Positional and Combinatorial Part I of II Statistical Mechanics - Games 10:00 AM-12:30 PM Part I of II 10:00 AM-12:30 PM Room:Greenway C-H 10:00 AM-12:30 PM Room:Greenway B For Part 2 see MS19 Room:Greenway A The theory of positional games is a rapidly evolving, relatively young topic Many questions in Extremal Graph For Part 2 see MS34 that is deeply linked to several popular Theory can be formulated as follows: Organizer: Richard Kenyon how does some (global) parameter Brown University, USA areas of Mathematics and Theoretical force some (local) structure? An Computer Science, such as random 10:00-10:25 Asymptotics of graph theory, Ramsey theory, complexity increasingly important trend in the Symmetric Polynomials with theory and derandomization. Results on area has been the use of probabilistic Applications to Statistical techniques and viewpoints. This Mechanics Models positional games have been used to make approach has led to a number Greta Panova, University of California, decisive progress in these areas. of recent successes and also to Los Angeles, USA Organizer: Dan Hefetz connections with other areas. 10:30-10:55 Electroid Varieties and University of Birmingham, United Kingdom Organizer: Deryk Osthus a Compactification of the Space Organizer: Michael Krivelevich University of Birmingham, United of Electrical Networks Tel Aviv University, Israel Kingdom Thomas Lam, University of Michigan, USA 10:00-10:25 Does the Random Graph 10:00-10:25 A Refinement of the Intuition Help when Orientations are Ore-type Version of the Corrádi- 11:00-11:25 Title Not Available at Involved? Hajnal Theorem Time of Publication Dennis Clemens, Freie Universität Berlin, Alexandr Kostochka, University of Pavlo Pylyavskyy, University of Germany; Heidi Gebauer, ETH Zürich, Illinois at Urbana-Champaign, USA Minnesota, USA Switzerland; Anita Liebenau, University of Warwick, United Kingdom 10:30-10:55 Cycle Packing 11:30-11:55 Arctic Curves of the David Conlon, University of Oxford, Octahedron Equation 10:30-10:55 Generating Random United Kingdom; Jacob Fox, Rodrigo A. Soto Garrido and Philippe Graphs in Biased Maker-Breaker Massachusetts Institute of Technology, Di Francesco, University of Illinois at Games USA; Benjamin Sudakov, University of Urbana-Champaign, USA Ferber Asaf, ETH Zürich, Switzerland; California, Los Angeles, USA 12:00-12:25 Rowmotion, Michael Krivelevich, Tel Aviv University, Israel; Humberto Naves, ETH Zürich, 11:00-11:25 Robustness of Graphs - Homomesy, and the Razumov- Switzerland Case Study: Dirac’s Theorem Stroganov Ex-conjecture Choongbum Lee, Massachusetts Institute Jessica Striker, North Dakota State 11:00-11:25 Maker-Breaker Games on of Technology, USA; Michael University, USA Random Geometric Graphs Krivelevich, Tel Aviv University, Andrew J. Beveridge, Macalester College, Israel; Benny Sudakov, ETH Zürich, USA; Andrzej Dudek, Western Michigan Switzerland University, USA; Alan Frieze, Carnegie Mellon University, USA; Tobias Muller, 11:30-11:55 Packing Trees of Utrecht University, The Netherlands; Milos Bounded Degree Stojakovic, University of Novi Sad, Serbia Mathias Schacht and Messuti Silvia, Universitat Hamburg, Germany; 11:30-11:55 Walker vs Breaker Vojtech Rödl, Emory University, USA Lisa Espig and Alan Frieze, Carnegie Mellon University, USA; Michael Krivelevich, Tel 12:00-12:25 Proof of Two Aviv University, Israel; Wesley Pegden, Conjectures of Thomassen on Carnegie Mellon University, USA Tournaments Daniela Kuhn, John Lapinskas, 12:00-12:25 Picker-Chooser Fixed and Deryk Osthus, University of Graph Games Birmingham, United Kingdom; Viresh Malgorzata Bednarska-Bzdega, Adam Patel, Queen Mary University, London, Mickiewicz University, Poland; Dan United Kingdom; Timothy Townsend, Hefetz, University of Birmingham, University of Birmingham, United United Kingdom; Tomasz Luczak, Adam Kingdom Mickiewicz University, Poland 12 2014 SIAM Conference on Discrete Mathematics

Monday, June 16 Monday, June 16 Monday, June 16 MS4 MS5 MS6 Selected Contributed Talks - Modeling Networks under Graph Homomorphisms: Part I of II Exact and Soft Constraints Edge Colours, Signs, and 10:00 AM-12:30 PM 10:00 AM-12:30 PM Crossings Room:Greenway I Room:Greenway J 10:00 AM-12:30 PM For Part 2 see MS39 There is demand to produce random Room:Skyway A This minisymposium consists of five large networks with prescribed Homomorphisms are structure preserving contributed talks that were selected by the properties like degree sequence, maps which are natural objects of study Organizing Committee. assortativity or disassortativity, etc. in mathematics. In graph theory they are Organizer: Sergey Norin The prescribed properties may be defined as edge preserving vertex maps. McGill University, Canada required in expectation, or exactly. This One may impose additional restrictions area is under intense study, current 10:00-10:25 σ-Polynomials and Their on how the edges map through the use best methods involve fast convergent Roots of edge-colours, signs, or geometric Markov chains, based on some swap Jason Brown and Aysel Erey, Dalhousie properties like crossing. Such restrictions University, Canada operations, or the exponential random lead to interesting results along the lines graph model, which is mostly pursued of complexity, duality, and structural 10:30-10:55 4-coloring Graphs with No by physicists. While unsolved problems Induced 5-cycle and 6-vertex Path characterizations. The minisymposium are abound, the logic of mathematical Maria Chudnovsky, Peter Maceli, Juraj consists of: an introduction to discovery already resulted in Stacho, and Mingxian Zhong, Columbia homomorphisms with edge constraints; a University, USA corresponding major open problems for talk examining the key role edge-colours hypergraphs. We bring together some and switching plays in their study; two 11:00-11:25 Unique Vector Coloring of the best experts on this area. Robert Samal, Charles University, Czech talks on signed graph homomorphisms; Republic; David Roberson, Nanyang Organizer: Laszlo Szekely and a geometric restriction based on Technological University, Singapore University of South Carolina, USA crossing edges. 11:30-11:55 A Geometric Foundation Organizer: Eva Czabarka Organizer: Richard Brewster to Information Networks University of South Carolina, USA Thompson Rivers University, Canada Dimitri Papadimitriou, Bell Laboratories, 10:00-10:25 Constrained Graph Organizer: Gary MacGillivrary Lucent Technologies, USA Construction Problems for Network University of Victoria, Canada 12:00-12:25 Independent Set, Induced Modeling Purposes 10:00-10:25 Graph Homomorphisms: Matching, and Pricing: Connections Zoltan Toroczkai, University of Notre Edge Colours, Signs, and Crossings, An and Tight (Subexponential Time) Dame, USA Introduction Approximation Hardnesses 10:30-10:55 Sampling Graphs Using Richard Brewster, Thompson Rivers Bundit Laekhanukit, McGill University, Markov Chains University, Canada Canada Catherine Greenhill, University of New South Wales, Australia 10:30-10:55 Colourings of Edge- Coloured Graphs and the Vertex 11:00-11:25 Networks with Similar Switching Operation Assortativity - JDMs and PAMs Gary MacGillivrary and J. Maria Warren, Eva Czabarka, University of South University of Victoria, Canada Carolina, USA 11:00-11:25 Signed Graph 11:30-11:55 Hypergraph Problems Homomorphisms Arising from Networks in Algebraic Reza Naserasr, CNRS, France Statistics Sonja Petrovic, Illinois Institute of 11:30-11:55 Complexity of Signed Technology, USA Graph Homomorphisms Richard Brewster, Thompson Rivers 12:00-12:25 Subgraphs in Random University, Canada; Florent Foucaud, Non-uniform Hypergraphs Université Paris Dauphine, France; Pavol Edward Boehnlein and Linyuan Lu, Hell, Simon Fraser University, Canada; Reza University of South Carolina, USA Naserasr, CNRS, France 12:00-12:25 Geometric Homomorphisms and the Geochromatic Number Debra L. Boutin and Sally Cockburn, Hamilton College, USA; Alice M. Dean, Skidmore College, USA 2014 SIAM Conference on Discrete Mathematics 13

Monday, June 16 Monday, June 16 Monday, June 16 MS7 IP2 MS8 Posets - Part I of II Rota’s Conjecture Ramsey Theory - Part I of II 10:00 AM-12:30 PM 2:00 PM-2:45 PM 3:15 PM-5:45 PM Room:Skyway B Room:Greenway C-H Room:Greenway C-H For Part 2 see MS25 Chair: Pavol Hell, Simon Fraser University, For Part 2 see MS36 The sessions will feature international Canada There has recently been many exciting experts presenting their research on In 1970, Gian-Carlo Rota posed developments in Ramsey theory. This the combinatorics of finite partially a conjecture giving a succinct minisymposium will cover some of ordered sets (posets). We are interested combinatorial characterization of the these important recent advances in in the structure and extremal properties linear dependencies among a finite set the area, including graph Ramsey of posets and set systems, building of vectors in a vector space over any theory, Ramsey numbers, and Ramsey on work over the last 90 years. Talks given finite field. I will discuss the theorems in random structures. will address dimension theory, Sperner conjecture as well as joint work with Organizer: Jacob Fox theory, algorithms for partitioning Bert Gerards and Geoff Whittle that led Massachusetts Institute of Technology, USA posets, and applications. Some will to a solution. Organizer: Andrey Grinshpun concern a problem that has attracted Jim Geelen Massachusetts Institute of Technology, USA considerable interest in the past ten University of Waterloo, Canada years: Given a finite poset P, what is 3:15-3:40 Sharp Thresholds for Van Der Waerden’s Theorem the maximum size La(n,P) of a family Mathias Schacht, Universitat Hamburg, of subsets of an n-set that contains no Germany; Ehud Friedgut, Weizmann subfamily P? Coffee Break Institute of Science, Israel; Hiep Han, Organizer: Jerry Griggs 2:45 PM-3:15 PM Emory University, USA; Yury Person, University of South Carolina, USA University of Frankfurt, Germany Room:Greenway Promenade 10:00-10:25 Largest Union-intersecting 3:45-4:10 Ordered Ramsey Numbers Families David Conlon, University of Oxford, United Gyula Katona, Hungarian Academy of Kingdom; Jacob Fox and Choongbum Sciences, Hungary Lee, Massachusetts Institute of Technology, USA; Benny Sudakov, ETH 10:30-10:55 Extremal Problems on Zürich, Switzerland Posets and Hypergraphs Linyuan Lu and Travis Johnston, University 4:15-4:40 Solution to the Erdös- of South Carolina, USA Gyárfás Conjecture on Generalized Ramsey Numbers 11:00-11:25 Estimation of the Size of Choongbum Lee, Massachusetts Institute Families Not Containing the Given of Technology, USA; David Conlon, Posets University of Oxford, United Kingdom; Hong-Bin Chen, Academia Sinica, China; Jacob Fox, Massachusetts Institute of Wei-Tian Li, National Chung-Hsing Technology, USA; Benny Sudakov, ETH University, Taiwan Zürich, Switzerland 11:30-11:55 Packing Posets in the 4:45-5:10 On the Ramsey Number of Boolean Lattice the Clique and the Hypercube Andrew Dove and Jerry Griggs, University Jozef Skokan, London School of Economics, of South Carolina, USA United Kingdom 12:00-12:25 Recent Progress on 5:15-5:40 On the Size Ramsey Diamond-free Families Numbers and their Variations Lucas J. Kramer, Ryan R. Martin, and Andrzej Dudek, Western Michigan Michael Young, Iowa State University, University, USA USA

Lunch Break 12:30 PM-2:00 PM Attendees on their own 14 2014 SIAM Conference on Discrete Mathematics

Monday, June 16 Monday, June 16 Monday, June 16 MS9 MS10 MS11 Graph Colouring - Part I of II Discrete Geometry - Spectral Graph Theory - 3:15 PM-5:45 PM Part I of II Part I of II Room:Greenway A 3:15 PM-5:15 PM 3:15 PM-5:15 PM For Part 2 see MS37 Room:Greenway B Room:Greenway I Graph colorings and other restricted For Part 2 see MS14 For Part 2 see MS29 partitions play a central role in discrete The minisymposium aims to appeal to Spectral graph theory studies structural mathematics. They also have numerous the visual and combinatorial senses of properties of graphs by the use of practical applications. New theoretical the audience. Topics that are likely to be eigenvalues of various associated and algorithmic results on graph mentioned: nice arrangements of points matrices. In this minisymposium, we colorings will be presented in this and lines, overlaps between geometric focus on applications of spectral analysis minisymposium. shapes, connections to combinatorial to wider topics in graph theory, as Organizer: Zdenek Dvorak number theory, Ramsey-type theorems well as behavior of the spectrum of a Charles University, Czech Republic for points and curves, computational graph under various perturbations and 3:15-3:40 Colorings and Independent problems, and of course the new and operations. Sets of Triangle-Free Planar Graphs unexpected. Organizer: Mary Radcliffe Zdenek Dvorak, Charles University, Czech Organizer: Boris Bukh University of Washington, USA Republic; Matthias Mnich, Max Planck Carnegie Mellon University, USA Institute for Informatics, Germany Organizer: Stephen J. Young 3:15-3:40 Simplifying Inclusion - University of Louisville, USA 3:45-4:10 Subcubic Triangle-free Exclusion Formulas Graphs have Fractional Chromatic 3:15-3:40 An Alon-Boppana Result for Xavier Goaoc, Université Paris-Est Marne-la- the Normalized Laplacian Number at most 14/5 Vallée, France Zdenek Dvorak, Charles University, Czech Stephen J. Young, University of Louisville, Republic; Jean-Sébastien Sereni, CNRS, 3:45-4:10 Erdös--Szekeres-type USA Statements in Dimension 1 France; Jan Volec, University of Warwick, 3:45-4:10 The Spectrum of Erdos- Boris Bukh, Carnegie Mellon University, USA; United Kingdom Renyi Random Graphs Near the Jiri Matousek, Charles University, Czech Connectivity Threshold 4:15-4:40 Acyclic List Coloring on Republic Christopher Hoffman, University of Planar Graphs 4:15-4:40 Splitting Points and Washington, USA; Matt Kahle, The Ohio Min Chen, Zhejiang Normal University, Hyperplanes State University, USA; Elliot Paquette, China; Andre Raspaud, Universite de Pablo Soberón, University of Michigan, USA; Weizmann Institute of Science, Israel Bordeaux I, France Edgardo Roldán-Pensado, Universidad 4:15-4:40 Gaps in Eigenfunctions of 4:45-5:10 Algorithms to Color Sparse Nacional Autónoma de México, Mexico Graphs Graphs 4:45-5:10 The Cylindrical Crossing Fan Chung-Graham, University of Matthew Yancey, University of Illinois at Number of the Complete Bipartite California, San Diego, USA Urbana-Champaign, USA Graph 4:45-5:10 Interlacing Families and 5:15-5:40 On Thue Colourings of Athena C. Sparks and Silvia Fernandez, Bipartite Ramanujan Graphs Graphs California State University, Northridge, Adam Marcus, Yale University, USA Erika Skrabulakova, Technical University of USA Kosice, Slovakia; Jens Schreyer, Technical University of Ilmenau, Germany 2014 SIAM Conference on Discrete Mathematics 15

Monday, June 16 Monday, June 16 Monday, June 16 CP1 CP2 CP3 Random Structures Applications Matroids, Arrangements, 3:15 PM-5:15 PM 3:15 PM-5:35 PM Large Networks Room:Greenway J Room:Skyway A 3:15 PM-5:35 PM Chair: Dana Randall, Georgia Institute of Chair: Anthony Bonato, Ryerson University, Room:Skyway B Technology, USA Canada Chair: David A. Pike, Memorial University, 3:15-3:30 Degeneracy in R-Mat 3:15-3:30 Accumulation Behavior and Newfoundland, Canada Generated Graphs Product Forecasting 3:15-3:30 Maps on Surfaces and Alex Chin, North Carolina State University, Thomas Morrisey, Information Systems Matroids USA; Timothy Goodrich, Valparaiso Laboratories, USA Goran Malic, University of Manchester, University, USA; Blair Sullivan, North 3:35-3:50 Various Notions and United Kingdom Carolina State University, USA Generalizations of Algebraically 3:35-3:50 On the Number of Bases in a 3:35-3:50 Percolation in the Weighted Coded Security System with Matroid Random Connection Model Applications to Security and Privacy Wing Hong Tony Wong, Kutztown University Milan Bradonjic, Bell Labs, Alcatel-Lucent, Benard O. Nyaare, Jaramogi Oginga Odinga of Pennsylvania, USA; Sin Tsun Edward USA University of Science and Technology, Fan, California Institute of Technology, 3:55-4:10 De-Preferential Attachment Kenya USA Random Graphs 3:55-4:10 Statistical and Hierarchical 3:55-4:10 The Global Invariant of Subhabrata Sen, Stanford University, USA; Graph Analysis for Cyber Security Graphic Hyperplane Arrangements Antar Bandyopadhyay, Indian Statistical Emilie Hogan, Sutanay Choudhury, Peter Hui, Guangfeng Jiang, Qiumin Guo, Wentao Institute, India and Cliff Joslyn, Pacific Northwest National Hu, and Ling Guo, Beijing University of 4:15-4:30 Identifying Codes and Laboratory, USA Chemical Technology, China Searching with Balls in Graphs 4:15-4:30 Qubit Unextendible Product 4:15-4:30 The Abstract Algebra of Big Younjin Kim, KAIST, Korea; Mohit Bases Data and Associative Arrays Kumbhat, Sungkyunkwan University, Nathaniel D. Johnston, University of Waterloo, Jeremy Kepner and Julian Chaidez, Korea; Zoltan Nagy and Balazs Patkos, Canada Massachusetts Institute of Technology, USA Renyi Institute, Hungary; Alexey 4:35-4:50 Online Streaming of Pokrovskiy, Freie Universität Berlin, 4:35-4:50 Necessarily Flat Polytopes Intersection Graphs Germany; Mate Vizer, Renyi Institute, Joshua B. Tymkew, Western Michigan Sandeep Koranne, Mentor Graphics Hungary University, USA Corporation, USA 4:35-4:50 Hyperbolicity of Random 4:55-5:10 Aliens Vs Zombies: An 4:55-5:10 The Balance Optimization Intersection Graphs Introduction To Bipartite Dot Product Matthew Farrell, Cornell University, USA; Subset Selection (boss) Model for Graphs Timothy Goodrich, Valparaiso University, Causal Inference Sean Bailey and David E. Brown, Utah State Sheldon H. Jacobson, University of Illinois at USA; Nathan Lemons, Los Alamos University, USA Urbana-Champaign, USA; Jason Sauppe, National Laboratory, USA; Blair Sullivan, University of Illinois, USA; Edward Sewell, 5:15-5:30 On the Type(s) of Minimum North Carolina State University, USA Southern Illinois University, Edwardsville, Size Subspace Partitions 4:55-5:10 Anti-Ramsey Number of USA Esmeralda L. Nastase, Xavier University, USA Matchings in Hypergraphs 5:15-5:30 A Predictive Model for Gis Lale Ozkahya, Hacettepe Universýty, Turkey; Jorge Diaz-Castro, University of Puerto Rico, Michael Young, Iowa State University, Puerto Rico USA Dinner Break 5:45 PM-8:00 PM Attendees on their own 16 2014 SIAM Conference on Discrete Mathematics

Monday, June 16 Tuesday, June 17 Tuesday, June 17 Hot Topic Session: MS12 The Existence of Designs Graph Polynomials: Towards 8:00 PM-9:00 PM Registration a General Theory - Part I of II Room:Greenway C-H 8:15 AM-3:45 PM 10:00 AM-12:00 PM Chair: Ron Graham, University of California, Room:Greenway Promenade Room:Greenway C-H San Diego, USA For Part 2 see MS43 We prove the existence conjecture for The last ten years have seen increased combinatorial designs, answering a activity in the study of graph invariants question of Steiner from 1853. More IP3 in the form of partition functions, generally, we show that the natural Covering Systems of generalized chromatic polynomials and divisibility conditions are sufficient for Congruences subgraph-counting generating functions. A general theory is gradually emerging clique decompositions of simplicial 8:45 AM-9:30 AM complexes that satisfy a certain that brings together the seemingly pseudorandomness condition. Room:Greenway C-H disjunct objects, techniques and concepts Peter Keevash Chair: Jozsef Solymosi, University of British that have hitherto characterized the University of Oxford, United Kingdom Columbia, Canada area of polynomial graph invariants, A distinct covering system of now over a century old since Birkhoff’s congruences is a collection a mod m , introduction of the chromatic i i polynomial in 1912. The purpose of this 1< m1 < m2 < ... < mk, whose union is the integers. Covering systems were minisymposium is to provide a forum introduced by Paul Erdos, who used the for different directions of contemporary system research on graph polynomials with a view to further developing this unifying approach. Organizer: Johann A. Makowsky to produce an odd arithmetic Technion - Israel Institute of Technology, Israel progression none of whose members is of the form a prime plus a power Organizer: Andrew J. Goodall of two. Two well-known questions of Charles University, Czech Republic Erdos concern covering systems. The Organizer: Joanna Ellis-Monaghan minimum modulus problem asks if there Saint Michael’s College, USA exist distinct covering systems for which 10:00-10:25 Generalized Chromatic m1 is arbitrarily large. The odd modulus Polynomials problem asks for a distinct covering Tomer Kotek, Vienna University of system with all moduli odd. I will Technology, Austria; Janos Makowsky, describe aspects of my negative answer Technion Israel Institute of Technology, to the minimum modulus problem and Israel ongoing joint work with Pace Nielsen 10:30-10:55 Algebraic Properties of the toward the odd modulus problem. The Chromatic Polynomial arguments involve techniques from Kerri Morgan and Graham Farr, Monash graph theory and PDE. University, Australia Robert Hough 11:00-11:25 Counting Cuts, Matchings, Oxford University, United Kingdom Bipartite Subgraphs, and Dominating Sets: The Bipartition Polynomial of a Graph Peter Tittmann, University of Applied Coffee Break Sciences, Germany 9:30 AM-10:00 AM 11:30-11:55 Caterpillars and the U-polynomial Room:Greenway Promenade Jose Zamora, Universidad Andres Bello, Santiago, Chile 2014 SIAM Conference on Discrete Mathematics 17

Tuesday, June 17 Tuesday, June 17 Tuesday, June 17 MS13 MS14 MS15 Biological Networks Discrete Geometry - Part II Pursuit Games on Graphs - 10:00 AM-12:30 PM of II Part I of II Room:Greenway A 10:00 AM-12:30 PM 10:00 AM-12:30 PM Discrete Mathematics and Graph Room:Greenway B Room:Greenway I Theoretic Techniques can be useful For Part 1 see MS10 For Part 2 see MS45 for studying real biological networks. The minisymposium aims to appeal to Pursuit games on graphs originated in the We look at some current research and the visual and combinatorial senses of early eighties with the introduction of the directions in the field. the audience. Topics that are likely to be Game of Cops and Robbers. Since then, Organizer: Lenore J. Cowen mentioned: nice arrangements of points researchers have investigated a variety Tufts University, USA and lines, overlaps between geometric of pursuit games focussed on capture, 10:00-10:25 New Metrics for Protein shapes, connections to combinatorial containment or control of an adversary. Interaction Networks number theory, Ramsey-type theorems The last decade has witnessed a wealth Lenore J. Cowen, Mengfei Cao, Hao Zhang, for points and curves, computational of pursuit game results in structural, and Jisoo Park, Tufts University, USA; problems, and of course the new and probabilistic and algorithmic graph Noah Daniels, Massachusetts Institute of unexpected. theory. This minisymposium will bring Technology, USA; Mark Crovella, Boston Organizer: Boris Bukh together leading researchers in the field University, USA; Ben Hescott, Tufts Carnegie Mellon University, USA to discuss state-of-the-art work on the University, USA subject. 10:00-10:25 Embeddability in the 10:30-10:55 Large Highly Connected 3-sphere is Decidable Organizer: Andrew J. Beveridge Clusters in Protein-Protein Interaction Jiriˇ Matousek, ˇ Charles University, Czech Macalester College, USA Networks Republic; Eric Sedgwick, DePaul Debra Goldberg, University of Colorado 10:00-10:25 The Robber Strikes Back University, USA; Martin Tancer and Uli Anthony Bonato, Ryerson University, Canada Boulder, USA Wagner, IST, Austria 11:00-11:25 Efficiently Enumerating 10:30-10:55 Edge Contraction and 10:30-10:55 On the Number of Plane Cop-Win Critical Graphs All Connected Induced Subgraphs of Graphs with Polyline Edges a Large Molecular Network Shannon L. Fitzpatrick, University of Prince Csaba D. Toth, California State University, Edward Island, Canada; Ben Cameron, Mehmet Koyuturk, Sean Maxwell, and Mark Northridge, USA Chance, Case Western Reserve University, Dalhousie University, Canada USA 11:00-11:25 Delaunay Complexes, 11:00-11:25 Cops and Invisible Noneuclidean Geometry, and 11:30-11:55 Network-Based Rnaseq Robbers Complexity Dariusz Dereniowski, Gdansk University Quantification and Survival Analysis Igor Rivin, Brown University, USA for Cancer Genomics of Technology, Poland; Danny Dyer and Wei Zhang and Baolin Wu, University of 11:30-11:55 Space Curve Ryan Tifenbach, Memorial University, Minnesota, USA; Hui Zheng, Guangzhou Arrangements with Many Incidences Newfoundland, Canada; Boting Yang, University, China; Rui Kuang, University Josh Zahl, Massachusetts Institute of University of Regina, Canada of Minnesota, USA Technology, USA 11:30-11:55 Fighting Fires on Layered 12:00-12:25 Computational 12:00-12:25 Improvements on the Grids Approaches for Analyzing Large- Elekes-Rónyai Method Amir Barghi and Nicole Rosato, Bard College, scale Genetic Interaction Networks Jozsef Solymosi, University of British USA Chad Myers, University of Minnesota, USA Columbia, Canada; Micha Sharir and Orit 12:00-12:25 Ambush Cops and Raz, Tel Aviv University, Israel Robbers on Graphs with Small Girth Nancy E. Clarke, Acadia University, Canada 18 2014 SIAM Conference on Discrete Mathematics

Tuesday, June 17 Tuesday, June 17 Tuesday, June 17 MS16 MS17 MS18 Cycles and Paths in Graphs - Extremal Combinatorics Variations within Chromatic Part I of II 10:00 AM-12:30 PM Graph Theory 10:00 AM-12:30 PM Room:Skyway A 10:00 AM-12:30 PM Room:Greenway J Extremal Combinatorics is a fast Room:Skyway B For Part 2 see MS30 developing and important area within Classical vertex-coloring of graphs has Finding special cycles/paths has been Combinatorics that investigates the led to many intriguing variations. The a fundamental, yet difficult, problem extrema of parameters of combinatorial edge-coloring equivalent of the four- in graph theory. This minisymposium objects such as codes, graphs, color problem was known early, and focuses on the recent progresses hypergraphs, set systems, etc. It has both colorings were investigated also on in finding long cycles (including applications in many fields, including nonplanar surfaces. Soon algebraic, as hamiltonian cycles), spectra of cycle number theory, optimization, theoretical well as topological methods, developed as lengths, and cycle structural of special computer science, and etc. Here we with graph automorphism groups. Also graphs. focus on Turan type extremal problems, extensions of precolorings were studied, which ask how large/dense a system Organizer: Guantao Chen their existence and multiplicities. In can be subject to some local constraints; Georgia State University, USA this session we will hear talks on edge- for instance the constraints may be the coloring of snarks on the Klein bottle, 10:00-10:25 Long Cycles in Graphs avoidance of some substructures. The with Bounded Degrees some map color theorems on surfaces, talks will cover a wide spectrum of Guantao Chen, Georgia State University, the distinguishing chromatic number of USA; Zhicheng Gao, Carleton University, results of such nature, discussing latest planar graphs, defining sets for graph Canada; Songling Shan, Georgia State tools used in solving these problems, colorings and their connections with University, USA; Xingxing Yu, Georgia and suggesting new directions for future critical sets in Latin squares and Sudoku. Institute of Technology, USA; Wenan Zang, developments. University of Hong Kong, China Organizer: Joan P. Hutchinson Organizer: Tao Jiang Macalester College, USA 10:30-10:55 Minimum Degree and Miami University, USA Disjoint Cycles in Generalized Claw- 10:00-10:25 Small Snarks and 10:00-10:25 Turan Problem for 6-chromatic Triangulations on the Klein free Graphs Hypergraph Forests Ralph Faudree, University of Memphis, USA Bottle Tao Jiang, Miami University, USA Sarah-Marie Belcastro, Smith College, USA 11:00-11:25 On Chorded Cycles 10:30-10:55 Large Forbidden Ronald Gould, Emory University, USA 10:30-10:55 Coloring Maps on Surfaces Configurations Atsuhiro Nakamoto, Yokohama National 11:30-11:55 Vertex-Disjoint Theta Richard P. Anstee, University of British University, Japan Subgraphs Columbia, Canada; Attila Sali, Alfréd Shinya Fujita, Yokohama National University, Rényi Institute of Mathematics, Hungary 11:00-11:25 Distinguishing Colorings of 3-regular Maps on Closed Surfaces Japan; Katsuhiro Ota, Keio University, 11:00-11:25 Turán Numbers for Bipartite Seiya Negami, Yokohama National University, Japan; Tadashi Sakuma, Yamagata Graphs Plus Odd Cycles Japan University, Japan Jacques Verstraete, University of California, 11:30-11:55 Sudoku, Latin Squares, and 12:00-12:25 Halin Graphs and San Diego, USA Defining Sets in Graph Coloring Generalized Halin Graphs 11:30-11:55 Maximizing the Number of Mohammed Mahdian, Google, Inc., USA Shoichi Tsuchiya, Tokyo University of Nonnegative Subsets Science, Japan Hao Huang, Rutgers University, USA 12:00-12:25 Defining Sets in Graph Coloring 12:00-12:25 The Manickam-Miklós- Ebadollah S. Mahmoodian, Sharif University Singhi Conjectures for Sets and Vector of Technology, Iran Spaces Ameera Chowdhury, Carnegie Mellon University, USA; Ghassan Sarkis and Shahriar Shahriari, Pomona College, USA Lunch Break 12:30 PM-2:00 PM Attendees on their own 2014 SIAM Conference on Discrete Mathematics 19

Tuesday, June 17 Tuesday, June 17 Tuesday, June 17 IP4 MS19 MS20 Submodular Functions and Extremal Graph Theory - Graph Structure - Part I of II Their Applications Part II of II 3:15 PM-5:45 PM 2:00 PM-2:45 PM 3:15 PM-5:45 PM Room:Greenway A Room:Greenway C-H Room:Greenway C-H For Part 2 see MS27 Structural graph theory seeks to Chair: William T. Trotter, Georgia Institute For Part 1 see MS1 of Technology, USA Many questions in Extremal Graph characterize graph properties by classifying all obstructions to the Submodular functions, a discrete Theory can be formulated as follows: how does some (global) parameter force properties. The methodology has analogue of convex functions, produced numerous results in the study have played a fundamental role in some (local) structure? An increasingly important trend in the area has been of graph minors and other containment combinatorial optimization since relations as well as graph algorithms, the 1970s. In the last decade, the use of probabilistic techniques and viewpoints. This approach has led to a graph coloring, and problems on paths there has been renewed interest in and cycles. submodular functions due to their number of recent successes and also to role in algorithmic game theory, as connections with other areas. Organizer: Paul Wollan University of Rome La Sapienza, Italy well as numerous applications in Organizer: Deryk Osthus machine learning. These developments University of Birmingham, United Kingdom 3:15-3:40 Packing A-paths with Specified Endpoints have led to new questions as well 3:15-3:40 The Structure of Digraphs not Daniel Marx, Hungarian Academy of as new algorithmic techniques. Containing a Fixed Subgraph Sciences, Hungary; Paul Wollan, I will discuss the concept of Daniela Kuhn, Deryk Osthus, and Timothy University of Rome La Sapienza, Italy submodularity, its unifying role in Townsend, University of Birmingham, combinatorial optimization, and a United Kingdom; Yi Zhao, Georgia State 3:45-4:10 Unavoidable Vertex-minors few illustrative applications. I will University, USA in Large Prime Graphs O-Joung Kwon and Sang-Il Oum, KAIST, describe some recent algorithmic 3:45-4:10 The Typical Structure of Korea advances, in particular the concept of Sparse H-free Graphs multilinear relaxation, and the role Jozsef Balogh, University of Illinois, USA; 4:15-4:40 A Refinement of the Grid of symmetry in proving hardness Robert Morris, IMPA, Brazil; Wojciech Theorem Jim Geelen and Benson Joeris, University of results for submodular optimization. Samotij, Tel Aviv University, Israel; Lutz Waterloo, Canada I will conclude by discussing Warnke, University of Oxford, United Kingdom possible extensions of the notion 4:45-5:10 Size Conditions for Rainbow of submodularity, and some future 4:15-4:40 A Blow-up Lemma for Matchings David M. Howard, Colgate University, USA challenges. Sparse Pseudorandom Graphs Peter Allen and Julia Boettcher, London 5:15-5:40 Packing Edge-Disjoint Jan Vondrak School of Economics, United Kingdom; Odd S-Cycles in 4-Edge-Connected IBM Almaden Research Center, USA Hiep Han, Emory University, USA; Graphs Yoshiharu Kohayakawa, Universidade de Yusuke Kobayashi and Naonori Kakimura, Sao Paulo, Brazil; Yury Person, University University of Tokyo, Japan; Ken-ichi of Frankfurt, Germany Kawarabayashi, National Institute of 4:45-5:10 Properly Coloured Hamilton Informatics, Japan Coffee Break Cycles in Edge-coloured Complete Graphs 2:45 PM-3:15 PM Allan Lo, University of Birmingham, United Room:Greenway Promenade Kingdom 5:15-5:40 Decomposition of Random Graphs into Complete Bipartite Graphs Xing Peng and Fan Chung, University of California, San Diego, USA 20 2014 SIAM Conference on Discrete Mathematics

Tuesday, June 17 Tuesday, June 17 Tuesday, June 17 MS21 MS22 MS23 Combinatorial Design Graph Limits and Flag Geometric Representations Theory- Part I of II Algebras of Graphs 3:15 PM-5:45 PM 3:15 PM-5:45 PM 3:15 PM-5:45 PM Room:Greenway B Room:Greenway I Room:Greenway J For Part 2 see MS38 Limits of discrete structures form an Visualizations and representations of In the past fifty years, combinatorial emerging area of combinatorics with graphs by means of intersections or design theory has developed into many exciting results and open problems. contacts of geometric objects have been a vibrant independent branch of There are notions of limits of various widely investigated. Classical examples combinatorics, with its own aims, discrete structures (graphs, hypergraphs, are interval graphs and Koebe circle methods and problems. It has found partial orders, permutations). Probably, representations. When representations are substantial applications in other the case of dense graphs developed in given they can sometimes be exploited in branches of combinatorics, in graph a series of papers by Borgs, Chayes, optimization problems or to obtain deep theory, coding theory and cryptography, Lovasz, Sos, Szegedy and Vesztergombi structural results. In many instances these theoretical computer science, statistics, is the most understood. The limit theory problems are hard for general graphs and algebra, among others. The talks is also related to a notion of flag algebras, but become polynomial-time solvable in this Minisymposium will reflect introduced by Razborov, that offers when restricted to intersection or contact the wide variety of problems and a framework for computer assistance graphs with a given representations. challenges of modern design theory, by with searching for assymptotically true Another class of problems is to compute including topics in resolvable designs, inequalities in discrete structures. The the representation or to decide whether latin squares, one-factorizations, triple minisymposium will offer a sample of it exists. We highlight some recent systems, large sets, and embeddings. some recent results from this area. developments in this active area at the Organizer: Alexander Rosa Organizer: Daniel Kral intersection of graph theory and discrete McMaster University, Canada University of Warwick, United Kingdom geometry. 3:15-3:40 How to Squash a 6-Cycle Organizer: Norin Sergey Organizer: Steven Chaplick System into a Steiner Triple System Princeton University, USA Technische Universität Berlin, Germany Charles C. Lindner, Auburn University, USA 3:15-3:40 Finitely Forcible Graphons 3:15-3:40 Extending Partial 3:45-4:10 Resolvable Or Near Roman Glebov, ETH Zürich, Switzerland Representations of Circle Graphs Resolvable Designs in Multiple Rooms Steven Chaplick, Technische Universität Marco Buratti, Università di Perugia, Italy 3:45-4:10 Estimating the Distance from Berlin, Germany; Radoslav Fulek, Columbia Testable Properties University, USA; Pavel Klavik, Charles 4:15-4:40 On Large Sets of Hamed Hatami, Princeton University, USA University, Czech Republic Combinatorial Objects Spyros S. Magliveras, Florida Atlantic 4:15-4:40 The Inducibility of Directed 3:45-4:10 Contact Representations of University, USA Graphs Planar Graph: Rebuilding Is Hard Hao Huang, Rutgers University, USA Jan Kratochvil, Charles University, Czech 4:45-5:10 Vertex-transitive Graphs of Republic; Steven Chaplick, Technische Prime-squared Order are Hamilton- 4:45-5:10 First Order Limits Universität Berlin, Germany; Paul Dorbec decomposable Daniel Kral, University of Warwick, and Mickael Montassier, ; Juraj Stacho, Donald L. Kreher, Michigan Technological United Kingdom; Martin Kupec, Charles Columbia University, USA University, USA University, Czech Republic; Anita Liebenau, University of Warwick, United Kingdom; 4:15-4:40 The Recognition of Simple- 5:15-5:40 A Three-Factor Product Lukas Mach and Vojtech Tuma, Charles Triangle Graphs and of Linear-Interval Construction for Mutually Orthogonal University, Czech Republic Orders is Polynomial Latin Squares George B. Mertzios, Durham University, Peter Dukes, University of Victoria, Canada 5:15-5:40 Rainbow Triangles in Three- colored Graphs United Kingdom Jozsef Balogh, University of Illinois, USA; 4:45-5:10 Coloring Geometric Ping Hu, University of Illinois at Urbana- Intersection Graphs via on-line Games Champaign, USA; Bernard Lidicky, Tomasz Krawczyk and Bartosz Walczak, University of Illinois, Urbana, USA; Florian Jagiellonian University, Poland Pfender, University of Colorado, Denver, USA; Jan Volec, University of Warwick, 5:15-5:40 Picking Planar Edges; United Kingdom; Michael Young, Iowa Or, Drawing a Graph with a Planar State University, USA Subgraph Marcus Schaefer, DePaul University, USA 2014 SIAM Conference on Discrete Mathematics 21

Tuesday, June 17 Tuesday, June 17 Wednesday, MS24 MS25 June 18 Polymer Models and Posets - Part II of II Combinatorics - Part I of III 3:15 PM-5:45 PM 3:15 PM-5:45 PM Room:Skyway B Registration Room:Skyway A For Part 1 see MS7 8:15 AM-3:45 PM For Part 2 see MS31 The sessions will feature international Room:Greenway Promenade The minisymposium will cover some experts presenting their research on the recent results related to applications of combinatorics of finite partially ordered discrete mathematics and combinatorics sets (posets). We are interested in the to biology, chemistry and physics. One structure and extremal properties of IP5 focus will be on applications to polymer posets and set systems, building on Approximation Algorithms and biopolymer modelling but other work over the last 90 years. Talks related methods and models will be will address dimension theory, Sperner Via Matrix Covers discussed. theory, algorithms for partitioning posets, 8:45 AM-9:30 AM and applications. Some will concern a Organizer: Christine Soteros Room:Greenway C-H University of Saskatchewan, Canada problem that has attracted considerable interest in the past ten years: Given a Chair: Bojan Mohar, Simon Fraser 3:15-3:40 Pulling Self-avoiding Walks finite poset P, what is the maximum size University, Canada from an Adsorbing Plane I will describe a general technique for EJ Janse van Rensburg, York University, La(n,P) of a family of subsets of an n-set Canada that contains no subfamily P? obtaining approximate solutions of hard quadratic optimization problems using Organizer: Jerry Griggs 3:45-4:10 On the Number of Walks in economical covers of high dimensional a Triangular Domain University of South Carolina, USA sets by small cubes. The analysis of the Thomas Prellberg and Paul Mortimer, 3:15-3:40 Planar Posets and Minimal method leads to intriguing algorithmic, Queen Mary University, London, United Elements Kingdom William T. Trotter and Ruidong Wang, Georgia combinatorial, geometric, extremal and probabilistic questions. Based on joint 4:15-4:40 Random Knots and Polymer Institute of Technology, USA papers with Troy Lee, Adi Shraibman and Models 3:45-4:10 On the Dimension of Posets Santosh Vempala. De Witt L. Sumners, Florida State University, with Cover Graphs of Treewidth 2 USA Gwenael Joret, University of Melbourne, Noga Alon 4:45-5:10 The Systematic Application Australia; Piotr Micek, Jagiellonian Tel Aviv University, Israel of Analytic Combinatorics of Several University, Poland; William T. Trotter Variables to Lattice Path Enumeration and Ruidong Wang, Georgia Institute of Problems Technology, USA; Veit Wiechert, TU Berlin, Marni Mishna, Simon Fraser University, Germany Coffee Break Canada 4:15-4:40 Forbidden Structures in the 9:30 AM-10:00 AM 5:15-5:40 Numerical Approach of Two Boolean Lattice Room:Greenway Promenade Friendly Walks in a Sticky Slab J. T. Johnston and Linyuan Lu, University of Thomas Wong, University of British South Carolina, USA; Kevin Milans, West Columbia, Canada Virginia University, USA 4:45-5:10 Some Recent Results about Cross Intersecting Families Norihide Tokushige, Ryukoku University, Japan 5:15-5:40 Symmetric Chain Decompositions of Quotients of Products Dwight Duffus, Emory University, USA; Kyle Thayer, RealGo, Inc., USA

SIAG/DM Business Meeting 5:50 PM-6:50 PM Room:Greenway C-H Complimentary beer and wine will be served. 22 2014 SIAM Conference on Discrete Mathematics

Wednesday, June 18 Wednesday, June 18 Wednesday, June 18 MS26 MS27 MS28 Probabilistic and Extremal Graph Structure - Part II of II Hardness of Approximation Combinatorics - Part I of II 10:00 AM-12:30 PM 10:00 AM-12:30 PM 10:00 AM-12:30 PM Room:Greenway A Room:Greenway B Room:Greenway C-H For Part 1 see MS20 It is known, since early 1990s, that For Part 2 see MS33 Structural graph theory seeks to for many NP-hard problems, it is Randomness often manifests itself in characterize graph properties by computationally hard (infeasible) the construction of a combinatorial classifying all obstructions to the to find even approximately optimal system or algorithm, as in the case of a properties. The methodology has solutions. For some problems such as so-called random graph. Intriguingly, produced numerous results in the study 3-SAT and CLIQUE, tight hardness it may also be artificially introduced of graph minors and other containment results are known, i.e. results that match as a proof technique to analyze purely relations as well as graph algorithms, the performance of the best known deterministic systems, an approach graph coloring, and problems on paths approximation algorithm. For most pioneered and popularized by Paul and cycles. problems however, VERTEX COVER Erdos. There is a rich interplay between Organizer: Paul Wollan and MAX-CUT being prominent probabilistic methods and extremal University of Rome La Sapienza, Italy examples, tight results are not known combinatorics, and this minisymposium 10:00-10:25 Treewidth-destroying and their pursuit has led to much will feature recent results from both Partitions of Graphs research, including new connections areas. Zdenek Dvorak, Charles University, Czech between computer science and Republic mathematics. The mini-symposium will Organizer: Thomas Bohman present a general overview of the area Carnegie Mellon University, USA 10:30-10:55 Inequivalent Representations of Highly Connected as well as some recent results. Organizer: Po-Shen Loh Matroids Carnegie Mellon University, USA Organizer: Subhash Khot Tony Huynh, University of Rome La New York University, USA 10:00-10:25 The Random Greedy Sapienza, Italy; Jim Geelen, University Algorithm for Independent Sets in of Waterloo, Canada; Bert Gerards, CWI, Organizer: Prasad Raghavendra Hypergraphs Amsterdam, Netherlands; Stefan van University of California, Berkeley, USA Patrick Bennett, University of Toronto, Zwam, Princeton University, USA 10:00-10:25 Introduction to Hardness Canada; Thomas Bohman, Carnegie 11:00-11:25 Non-planar Extensions of of Approximation Mellon University, USA Subhash Khot Subdivisions of Planar Graphs , New York University, USA 10:30-10:55 Juggling Card Sequences Sergey Norin, McGill University, Canada; 10:30-10:55 Analytical Approach to Ron Graham, University of California, San Robin Thomas, Georgia Institute of Parallel Repetition Diego, USA Technology, USA Irit Dinur, Weizmann Institute of Science, 11:00-11:25 Extremal Graphs for 11:30-11:55 Spanning Trees with Israel; David Steurer, Cornell University, Connectedness Vertices having Large Degrees USA Penny Haxell, University of Waterloo, Kenta Ozeki, National Institute of 11:00-11:25 Toward PCPs with Minimal Canada; Lothar Narins and Tibor Szabo, Informatics, Japan; Yoshimi Egawa, Tokyo Error Freie Universitaet Berlin, Germany University of Science, Japan Dana Moshkovitz, Massachusetts Institute of 11:30-11:55 Hamiltonian Increasing 12:00-12:25 Well-quasi-ordering Technology, USA Paths in Random Edge Orderings Graphs by the Topological Minor 11:30-11:55 Unique Games Mikhail Lavrov and Po-Shen Loh, Carnegie Relation Conjecture and Small Set Expansion Mellon University, USA Chun-hung Liu and Robin Thomas, Georgia Prasad Raghavendra, University of 12:00-12:25 Extremal Problems on Institute of Technology, USA California, Berkeley, USA Diameter 2-critical Graphs 12:00-12:25 A Characterization of Po-Shen Loh and Jie Ma, Carnegie Mellon Strong Approximation Resistance University, USA Madhur Tulsiani, Toyota Technological Institute at Chicago, USA 2014 SIAM Conference on Discrete Mathematics 23

Wednesday, June 18 Wednesday, June 18 Wednesday, June 18 MS29 MS30 MS31 Spectral Graph Theory - Cycles and Paths in Graphs Polymer Models and Part II of II - Part II of II Combinatorics - Part II of III 10:00 AM-12:30 PM 10:00 AM-12:30 PM 10:00 AM-12:30 PM Room:Greenway I Room:Greenway J Room:Skyway A For Part 1 see MS11 For Part 1 see MS16 For Part 1 see MS24 Spectral graph theory studies structural Finding special cycles/paths has been For Part 3 see MS41 properties of graphs by the use of a fundamental, yet difficult, problem The minisymposium will cover some eigenvalues of various associated in graph theory. This minisymposium recent results related to applications of matrices. In this minisymposium, focuses on the recent progresses discrete mathematics and combinatorics we focus on applications of spectral in finding long cycles (including to biology, chemistry and physics. One analysis to wider topics in graph theory, hamiltonian cycles), spectra of cycle focus will be on applications to polymer as well as behavior of the spectrum of a lengths, and cycle structural of special and biopolymer modelling but other graph under various perturbations and graphs. related methods and models will be operations. Organizer: Xingxing Yu discussed. Organizer: Mary Radcliffe Georgia Institute of Technology, USA Organizer: Christine Soteros University of Washington, USA Organizer: Guantao Chen University of Saskatchewan, Canada Organizer: Stephen J. Young Georgia State University, USA 10:00-10:25 Counting Knotted 2-Spheres in Tubes in Z4 University of Louisville, USA 10:00-10:25 Hamiltonicity of Stuart Whittington, University of Toronto, 10:00-10:25 Nonlinear Eigenvalues in 3-connected Planar Graphs with No Canada Random Regular Graphs K2,5 Minor Mary Radcliffe, University of Washington, Mark Ellingham and Emily Marshall, 10:30-10:55 Exact Solution of a Simple USA Vanderbilt University, USA; Kenta Ozeki, Adsorption Model of De-naturating National Institute of Informatics, Japan; DNA 10:30-10:55 Eigenvalue Stability Shoichi Tsuchiya, Tokyo University of Aleks Owczarek, University of Melbourne, under Hypermatrix Perturbation and Science, Japan Australia Random Hypergraphs Joshua Cooper, University of South 10:30-10:55 Combining Degree 11:00-11:25 Random Knots and Carolina, USA and Connectivity Bounds for Graph Confinement Considerations Linkages Mariel Vazquez, San Francisco State 11:00-11:25 Connected Hypergraphs Florian Pfender, University of Colorado, University, USA with Small Spectral Radius Denver, USA Linyuan Lu, University of South Carolina, 11:30-11:55 The Shape of a Hopf Link USA 11:00-11:25 A Spanning Tree Andrew Rechnitzer, University of British Homeomorphic to a Small Tree Columbia, Canada 11:30-11:55 Numerical Methods for Akira Saito and Kazuki Sano, Nihon Estimating the Minimum Rank and 12:00-12:25 Modeling Polymer University, Japan Zero Forcing Number of Large Graphs Adsorption at an Inhomogeneous Franklin Kenter, Rice University, USA 11:30-11:55 Forbidden Pairs for Surface the Existence of a Spanning Halin Gary K. Iliev and Stuart Whittington, 12:00-12:25 Minimum Rank, Subgraph University of Toronto, Canada; Enzo Maximum Nullity, and Zero Forcing Ping Yang, Georgia State University, USA; Orlandini, University of Padova, Italy Number Zdenek Ryjácek, University of West Leslie Hogben, Iowa State University, USA Bohemia, Pilsen, Czech Republic 12:00-12:25 2-Factors in Edge Chromatic Critical Graphs with Large Maximum Degree Songling Shan and Guantao Chen, Georgia State University, USA 24 2014 SIAM Conference on Discrete Mathematics

Wednesday, June 18 Wednesday, June 18 Wednesday, June 18 MS32 IP6 MS33 Combinatorics of Maps Interlacing Families and Probabilistic and Extremal 10:00 AM-12:30 PM Kaddison-Singer Combinatorics - Part II of II Room:Skyway B 2:00 PM-2:45 PM 3:15 PM-5:45 PM Maps are graphs embedded in surfaces, Room:Greenway C-H Room:Greenway C-H considered up to homeomorphism. Chair: Fan Chung, University of California, For Part 1 see MS26 From a combinatorial standpoint, a San Diego, USA Randomness often manifests itself in map is given by a graph together with This talk will focus on the resolution the construction of a combinatorial a cyclic ordering of its edges around of two conjectures that have been system or algorithm, as in the case of a the vertices. Maps are fundamental shown to be equivalent to open so-called random graph. Intriguingly, structures in many different branches of problems in a number of fields, most it may also be artificially introduced mathematics and physics. In particular famously a problem due to Kadison as a proof technique to analyze purely there are close relations between maps and Singer concerning the foundations deterministic systems, an approach and permutations (because maps can of mathematical physics. This will pioneered and popularized by Paul be used to encode factorizations of include introducing a new technique Erdos. There is a rich interplay between permutations), Schur functions and KP for establishing the existence of certain probabilistic methods and extremal hierarchy of equation (via the characters combinatorial objects that we call the combinatorics, and this minisymposium of the symmetric group), random “method of interlacing polynomials.” will feature recent results from both Gaussian matrices (via Feynman The technique seems to be interesting areas. diagrams), and random surfaces in its own right (it was also the main Organizer: Thomas Bohman (because maps are discretizations of tool for resolving the existence of Carnegie Mellon University, USA surfaces). Ramanujan graphs of arbitrary degree). Organizer: Po-Shen Loh Organizer: Olivier Bernardi This represents join work with Dan Carnegie Mellon University, USA Brandeis University, USA Spielman of Yale University and Nikhil 3:15-3:40 A Short Proof of Gowers’ 10:00-10:25 The KP Hierarchy and Srivastava of Microsoft Research, India. Lower Bound for the Regularity Generating Series for Maps Adam Marcus Lemma Sean Carrel, University of Waterloo, Canada Yale University, USA Guy Moshkovitz, Tel Aviv University, Israel 10:30-10:55 A Bijection for Rooted 3:45-4:10 Turán Function for the Maps on Non-orientable Surfaces Generalized Triangle Maciej Dolega, Universite Paris 7-Denis Sergey Norin and Liana Yepremyan, McGill Diderot, France Coffee Break University, Canada 11:00-11:25 A Graphical Proof of a 2:45 PM-3:15 PM 4:15-4:40 On the Number of Real Generalization of Boccara’s Theorem Room:Greenway Promenade Roots of Kac Polynomials Concerning the Multiplication of Long Hoi Nguyen, Ohio State University, USA Cycles 4:45-5:10 Partitioning Random Amarpreet Rattan, University of London, Hypergraphs United Kingdom Will Perkins, Georgia Institute of 11:30-11:55 The Brownian Continuum Technology, USA Random Tree Is the Scaling Limit of 5:15-5:40 Randomly Coloring Random Dissections Random Graphs Nicolas Curien, CNRS, France; Igor Alan Frieze, Carnegie Mellon University, Kortchemski, Ecole Normale Supérieure, USA France; Bénédicte Haas, Ceremade, France 12:00-12:25 Exploring Some Non- constructive Map Bijections Michael A. La Croix, Massachusetts Institute of Technology, USA

Lunch Break 12:30 PM-2:00 PM Attendees on their own 2014 SIAM Conference on Discrete Mathematics 25

Wednesday, June 18 Wednesday, June 18 Wednesday, June 18 MS34 MS35 CP4 Combinatorics and Graph Structure and Algebraic Methods Statistical Mechanics - Algorithms 3:15 PM-5:15 PM Part II of II 3:15 PM-5:45 PM Room:Greenway I 3:15 PM-5:45 PM Room:Greenway B Chair: Ron Gould, Emory University, USA Room:Greenway A Often graphs arising in applications 3:15-3:30 First Eigenvectors of Nonsingular Unicyclic 3-Colored For Part 1 see MS2 have special structure, which can sometimes be exploited to design Digraphs Organizer: Richard Kenyon Debajit Kalita, Tezpur University, India Brown University, USA efficient algorithms for problems that are hard in general. In this 3:35-3:50 Strong Double Graphs: 3:15-3:40 Maximum Independent Sets Spectral Properties, Energy and in Random d-regular Graphs minisymposium we look at special Laplacian Energy Jian Ding, University of Chicago, USA; structure such as excluding induced Shariefuddin Pirzada and Hilal Ganai, Allan Sly, University of California, paths and cycles, and when this allows University of Kashmir, India Berkeley, USA; Nike Sun, Stanford for efficient algorithms for graph University, USA coloring and related problems. 3:55-4:10 On the Matrix Sequence m 3:45-4:10 Slow Mixing for the Hard--­ Organizer: Kathie Cameron Γ(A ) {m=1} for a Boolean Matrix A Core Model on Z2 Wilfrid Laurier University, Canada Whose Digraph Is Linearly Connected Antonio Blanca, University of California, Jihoon Choi and Suh-Ryung Kim, Seoul 3:15-3:40 Recognizing and Colouring National University, Korea Berkeley, USA; David J. Galvin, Claw-Free Graphs Without Even Holes University of Notre Dame, USA; Dana Kathie Cameron, Wilfrid Laurier University, 4:15-4:30 A Combinatorial Randall and Prasad Tetali, Georgia Canada; Steven Chaplick, Technische Characterization of Binary Positional Institute of Technology, USA Universität Berlin, Germany; Chinh Number Systems Andrew Vince, University of Florida, USA 4:15-4:40 The Structure of the Abelian Hoang, Wilfrid Laurier University, Canada Sandpile 3:45-4:10 Coloring Graphs Without 4:35-4:50 G-Ham Sandwich Lionel Levine, Cornell University, USA; Induced Paths and Cycles Theorems: Harmonic Analysis and Wesley Pegden, Carnegie Mellon Shenwei Huang and Pavol Hell, Simon Measure Partitions University, USA; Charles Smart, Fraser University, Canada Steven Simon, Wellesley College, USA Massachusetts Institute of Technology, 4:55-5:10 Forcing Sets in Self-Folding USA 4:15-4:40 Digraph Analogues of Interval Graphs and of Trivially Origami 4:45-5:10 Phase Transitions in the Perfect Graphs Thomas Hull, Western New England Laplacian Determinant Pavol Hell, Simon Fraser University, Canada University, USA Richard Kenyon, Brown University, USA 4:45-5:10 On the Contour of Chordal 5:15-5:40 Local Statistics of the Bipartite Graphs Abelian Sandpile Model Danilo Artigas, Universidade Federal David B. Wilson, Microsoft Research, USA Fluminense, Brazil; R. Sritharan, University of Dayton, USA 5:15-5:40 Non-Planar Extensions of Planar Signed Graphs Bertrand Guenin and Katie Naismith, University of Waterloo, Canada 26 2014 SIAM Conference on Discrete Mathematics

Wednesday, June 18 Wednesday, June 18 Wednesday, June 18 CP5 CP6 CP7 Cycles Geometric Representations Coloring 3:15 PM-5:35 PM 3:15 PM-5:15 PM 3:15 PM-5:15 PM Room:Greenway J Room:Skyway A Room:Skyway B Chair: Mark Ellingham, Vanderbilt Chair: Jan Kratochvil, Charles University, Chair: Daniel Cranston, Virginia University, USA Czech Republic Commonwealth University, USA 3:15-3:30 Cycle Decompositions with 3:15-3:30 Almost Isometric Drawings 3:15-3:30 A Distance-Two Coloring a Certain Degree of Symmetry of Graphs with Application to Wireless Sensor Tommaso Traetta, Universita degli Studi di Jens Schreyer and Thomas Boehme, and Actor Networks Perugia, Italy Technical University of Ilmenau, Germany Wu-Hsiung Lin, Well Chiu, Yen-Cheng Chao, and Chiuyuan Chen, National Chiao 3:35-3:50 Loose Cycles in 3-Uniform 3:35-3:50 Weak Universality for Tung University, Taiwan Hypergraphs 2-Dimensional Parallel Drawings Andrzej M. Czygrinow, Arizona State David Richter, Western Michigan University, 3:35-3:50 Chromatic-Choosability of University, USA USA the Power of Graphs Seog-Jin Kim, Konkuk University, South 3:55-4:10 Nonempty Intersection 3:55-4:10 N-Flips in 4-Connected Korea; Young Soo Kwon, Yeungnam of Longest Paths in Series-Parallel Eulerian Triangulations on the Sphere University, Korea; Boram Park, National Graphs Naoki Matsumoto, Yokohama National Institute for Mathematical Sciences, Korea Carl Georg Heise and Julia Ehrenmueller, University, Japan 3:55-4:10 Steinberg’s Conjecture, the Hamburg University of Technology, 4:15-4:30 Analytical Properties Bordeaux Coloring Conjecture and Germany; Cristina Fernandes, University of Horizontal Visibility Graphs Near-Coloring of Sao Paulo, Brazil Generated by the Feigenbaum Carl Yerger, Davidson College, USA; Kyle 4:15-4:30 On 2-Factors with a Unversal Route to Chaos in Discrete Yang, Stanford University, USA Bounded Number of Odd Cycles Models Jennifer Diemunsch, Michael Ferrara, Tarini K. Dutta, Gauhati University, India 4:15-4:30 Equitable Coloring of Graphs with Intermediate Maximum Samantha Graffeo, and Timothy Morris, 4:35-4:50 New Characterizations of Degree University of Colorado, Denver, USA Proper Interval Bigraphs Ko-Wei Lih, Institute of Mathematics, 4:35-4:50 Hamiltonian Cycles in Ashok K. Das, University Of Calcutta, India Academia Sinica, Taipei, Taiwan; Bor- {1,4}-Leaper Graphs 4:55-5:10 Excluded Vertex-minors Liang Chen, National Taichung University Grady Bullington, Linda Eroh, and Steven for Graphs of Linear Rank-width at of Science and Technology, Taiwan; Kuo- J. Winters, University of Wisconsin, Most k Ching Huang, Providence University, Oshkosh, USA O-Joung Kwon, Sang-Il Oum, and Jisu Taiwan 4:55-5:10 Cycle Extendability of Jeong, KAIST, Korea 4:35-4:50 Coloring Planar Digraphs Chordal Graphs and Tournaments Ararat Harutyunyan, University of Oxford, David E. Brown, LeRoy Beasley, and United Kingdom Deborah Arangno, Utah State University, USA 4:55-5:10 Colorings with Fractional Defect 5:15-5:30 Near Perfect Matchings in Wayne Goddard and Honghai Xu, Clemson k-uniform Hypergraphs University, USA Jie Han, Georgia State University, USA

Dinner Break 5:45 PM-8:00 PM Attendees on their own 2014 SIAM Conference on Discrete Mathematics 27

Wednesday, June 18 Thursday, June 19 Thursday, June 19 SP1 MS36 2014 Dénes König Prize Ramsey Theory - Part II of II Registration Lecture: The Number of Ks,t 9:30 AM-12:00 PM 7:45 AM-3:15 PM -Free Graphs Room:Greenway C-H Room:Greenway Promenade 8:00 PM-8:45 PM For Part 1 see MS8 Room:Greenway C-H There has recently been many exciting developments in Ramsey theory. This Chair: Douglas B. West, Zhejiang Normal University, China and University of Illinois, IP7 minisymposium will cover some of USA these important recent advances in the Hamilton Decompositions of area, including graph Ramsey theory, The problem of enumerating H-free Ramsey numbers, and Ramsey theorems graphs with a given number of vertices Graphs and Digraphs in random structures. has been studied for almost forty years. 8:15 AM-9:00 AM Organizer: Jacob Fox As a result, a great deal is known about Room:Greenway C-H this problem. When H is not bipartite, Massachusetts Institute of Technology, USA we have not only good estimates of the Chair: Penny Haxell, University of Organizer: Andrey Grinshpun Waterloo, Canada number of H-free graphs, but also fairly Massachusetts Institute of Technology, USA precise structural characterisation of In this talk I will survey recent results 9:30-9:55 Monochromatic Bounded a typical such graph. On the contrary, on Hamilton decompositions, i.e. Degree Subgraph Partitions not much is known in case when H is decompositions of the edge-set of a Andrey Grinshpun, Massachusetts Institute bipartite. A few years ago, we proved graph or digraph into edge-disjoint of Technology, USA; Gabor Sarkozy, asymptotically optimal upper bounds Hamilton cycles. One example is a Worcester Polytechnic Institute, USA on the number of graphs not containing conjecture of Kelly from 1968, which 10:00-10:25 Hypergraph Ramsey states that every regular tournament has a fixed complete bipartite graph Ks,t. Numbers This was the first infinite family of a Hamilton decomposition. We prove Jacques Verstraete, University of California, bipartite graphs for which such a bound this conjecture for large tournaments. San Diego, USA was established. Since then, the method In fact, we prove a far more general 10:30-10:55 Multipass Random developed in our proof has found result, which has further applications. Coloring of Simple Uniform several interesting applications to a Another example is the Hamilton Hypergraphs large class of related problems. decomposition conjecture, which was Jakub Kozik, Jagiellonian University, Poland; posed by Nash-Williams in 1970. It Dmitry Shabanov, Lomonosov Moscow Wojciech Samotij State University, Russia Tel Aviv University, Israel; states that every regular graph on n vertices with minimum degree at least 11:00-11:25 Shelah’s Grid Ramsey Jozsef Balogh n/2 has a Hamilton decomposition (joint Problem University of Illinois, USA work with Bela Csaba, Allan Lo, Deryk Jacob Fox, Massachusetts Institute of Osthus and Andrew Treglown). Technology, USA; David Conlon, University of Oxford, United Kingdom; Daniela Kuhn Choongbum Lee, Massachusetts Institute University of Birmingham, United Kingdom of Technology, USA; Benny Sudakov, ETH Zürich, Switzerland 11:30-11:55 Restricted Ramsey-Type Coffee Break Theorems Vojtech Rödl and Hiep Han, Emory 9:00 AM-9:30 AM University, USA Room:Greenway Promenade 28 2014 SIAM Conference on Discrete Mathematics

Thursday, June 19 Thursday, June 19 Thursday, June 19 MS37 MS38 MS39 Graph Colouring - Combinatorial Design Selected Contributed Talks - Part II of II Theory - Part II of II Part II of II 9:30 AM-12:00 PM 9:30 AM-12:00 PM 9:30 AM-11:30 PM Room:Greenway A Room:Greenway B Room:Greenway I For Part 1 see MS9 For Part 1 see MS21 For Part 1 see MS4 Graph colorings and other restricted In the past fifty years, combinatorial This minisymposium consists of five partitions play a central role in discrete design theory has developed into contributed talks that were selected by mathematics. They also have numerous a vibrant independent branch of the Organizing Committee. practical applications. New theoretical combinatorics, with its own aims, Organizer: Gyula Katona and algorithmic results on graph methods and problems. It has found Hungarian Academy of Sciences, Hungary colorings will be presented in this substantial applications in other 9:30-9:55 On the Number of Bh-Sets minisymposium. branches of combinatorics, in graph Sang June Lee, KAIST, Korea; Domingos Organizer: Zdenek Dvorak theory, coding theory and cryptography, Dellamonica JR., Emory University, USA; Charles University, Czech Republic theoretical computer science, statistics, Yoshiharu Kohayakawa, Universidade de and algebra, among others. The talks Sao Paulo, Brazil; Vojtech RODL, Emory 9:30-9:55 Painting Squares in Δ2-1 in this Minisymposium will reflect University, USA; Wojciech Samotij, Tel Shades Aviv University, Israel Daniel Cranston, Virginia Commonwealth the wide variety of problems and University, USA; Landon Rabern, LBD challenges of modern design theory, by 10:00-10:25 On Erdös’ Conjecture on Software Solutions, USA including topics in resolvable designs, the Number of Edges in 5-Cycles latin squares, one-factorizations, triple Zeinab Maleki, Isfahan University of 10:00-10:25 Choosability of Graphs Technology, Iran; Zoltan Furedi, With Bounded Order systems, large sets, and embeddings. University of Illinois at Urbana- Jonathan A. Noel, University of Oxford, Organizer: Alexander Rosa Champaign, USA United Kingdom McMaster University, Canada 10:30-10:55 Large Subgraphs Without 10:30-10:55 List Coloring the Square 9:30-9:55 On a Problem of Mariusz Short Cycles of Sparse Graphs Meszka Guillem Perarnau, McGill University, Marthe Bonamy, Benjamin Léveque, and Alexander Rosa, McMaster University, Canada Alexandre Pinlou, Université Montpellier Canada II, France 11:00-11:25 Asymptotic Distribution 10:00-10:25 Switchings for of the Numbers of Vertices and Arcs 11:00-11:25 The Potential Technique 1-Factorizations in the Giant Strong Component in in Graph Coloring Ian Wanless, Monash University, Australia Sparse Random Digraphs Luke Postle, University of Waterloo, Canada 10:30-10:55 Biembeddings and Daniel J. Poole and Boris Pittel, The Ohio 11:30-11:55 Online and Size anti- Graph Decompositions State University, USA Ramsey Numbers Ben Smith, University of Queensland, Maria Axenovich and Torsten Ueckerdt, Australia Karlsruhe Institute of Technology, 11:00-11:25 Triple Systems, Gray Germany; Kolja Knauer, Université Codes and Snarks Montpellier II, France; Judith Stumpp, David A. Pike, Memorial University, Karlsruhe Institute of Technology, Newfoundland, Canada Germany 11:30-11:55 Approaching the Minimum Number of Clues Sudoku Problem Via the Polynomial Method John Schmitt, Middlebury College, USA 2014 SIAM Conference on Discrete Mathematics 29

Thursday, June 19 11:00-11:25 Stability of the Potential Thursday, June 19 Function MS40 Catherine Erbes and Michael Ferrara, MS41 University of Colorado, Denver, USA; Degree Sequences of Ryan R. Martin, Iowa State University, Polymer Models and Graphs and Hypergraphs USA; Paul Wenger, Rochester Institute of Combinatorics - Part III of III Technology, USA 9:30 AM-12:00 PM 9:30 AM-12:00 PM 11:30-11:55 Minimal Forbidden Room:Greenway J Sets for Degree Sequence Room:Skyway A Degree sequence are one of the simplest Characterizations For Part 2 see MS31 graph invariants, yet they encompasses Stephen Hartke, University of Nebraska, The minisymposium will cover some a tremendous amount of information Lincoln, USA; Michael D. Barrus, recent results related to applications of Brigham Young University, USA about their realizations. While the discrete mathematics and combinatorics degree sequences of graphs are widely to biology, chemistry and physics. One studied in a variety of contexts, focus will be on applications to polymer the degree sequences of k-uniform and biopolymer modelling but other hypergraphs for k ≥ 3 have received related methods and models will be considerably less attention and pose discussed. many new challenges. For instance, Organizer: Christine Soteros while numerous characterizations of University of Saskatchewan, Canada graphic sequences exist, for fixed 9:30-9:55 Inhomogeneous Percolation k ≥ 3 no efficient characterization of with a Defect Plane k-graphic sequences is known. This Neal Madras, York University, Canada; Gary minisymposium will present several K. Iliev, University of Toronto, Canada; new results on the degree sequences EJ Janse van Rensburg, York University, of graphs and hypergraphs, and will Canada discuss some exciting new research 10:00-10:25 Assorted Topics in the directions. Monte Carlo Simulation of Polymers Organizer: Michael Ferrara Nathan Clisby, University of Melbourne, Australia University of Colorado, Denver, USA 9:30-9:55 Degree Sequences of 10:30-10:55 Mitochondrial DNA Uniform Hypergraphs: Results and Organization in Trypanosomatid Open Problems Parasite Michael Ferrara, University of Colorado, Javier Arsuaga, San Francisco State Denver, USA; Behrens Sarah, University University, USA of Nebraska, Lincoln, USA; Catherine 11:00-11:25 Enumerating Knots in Erbes, University of Colorado, Denver, Lattice Tube Models of Polymers USA; Stephen Hartke, University of Christine Soteros, University of Nebraska, Lincoln, USA; Benjamin Saskatchewan, Canada Reiniger and Hannah Spinoza, University 11:30-12:00 Subknots in Closed of Illinois at Urbana-Champaign, USA; Chains Charles Tomlinson, University of Eric Rawdon, University of St. Thomas, Nebraska, Lincoln, USA USA 10:00-10:25 Degree Sequences and Forced Adjacency Relationships Michael D. Barrus, Brigham Young University, USA 10:30-10:55 The Asymptotic Behavior of the Potential Function Paul Wenger, Rochester Institute of Technology, USA; Michael Ferrara, University of Colorado, Denver, USA; Timothy LeSaulnier, National Security Agency, USA; Catherine Erbes, University of Colorado, Denver, USA; Ryan R. Martin, Iowa State University, USA

continued in next column 30 2014 SIAM Conference on Discrete Mathematics

Thursday, June 19 Thursday, June 19 Thursday, June 19 MS42 IP8 MS43 Combinatorics of The Complexity of Graph Graph Polynomials: Hyperbolic and Real Stable and Hypergraph Expansion Towards a General Theory - Polynomials Problems Part II of II 9:30 AM-12:00 PM 1:30 PM-2:15 PM 2:45 PM-5:15 PM Room:Skyway B Room:Greenway C-H Room:Greenway C-H Hyperbolic and real stable polynomials Chair: Alan Frieze, Carnegie Mellon For Part 1 see MS12 are multivariate generalizations of the University, USA The last ten years have seen increased class of univariate polynomials having The expansion of a graph is a activity in the study of graph invariants all real roots. They are remarkable in fundamental parameter with many in the form of partition functions, that they arise naturally in a variety connections in mathematics and generalized chromatic polynomials and of combinatorial, probabilistic, and applications in computer science. Two subgraph-counting generating functions. geometric situations, and are at the basic variants of expansion are edge- A general theory is gradually emerging same time well-behaved and quite expansion (minimum ratio of the number that brings together the seemingly well-understood analytically and of edges leaving a subset of vertices to disjunct objects, techniques and algebraically. This leads to a fruitful the total number of edge incident to the concepts that have hitherto characterized interplay in which hyperbolicity subset) and vertex expansion (minimum the area of polynomial graph invariants, and stability are used to deduce ratio of number of vertices adjacent to now over a century old since Birkhoff’s combinatorial results and vice versa. a subset to the size of the subset). Both introduction of the chromatic The minisymposium covers some are NP-hard to compute exactly and the polynomial in 1912. The purpose of this significant recent successes of this current best polynomial-time algorithms minisymposium is to provide a forum methodology. provide either an O(√log nOPT) solution for different directions of contemporary research on graph polynomials with a Organizer: Nikhil Srivastava these problems, or, for edge-expansion, view to further developing this unifying Microsoft Research, India an O(√OPT)solution. The latter is via Cheeger’s inequality relating edge approach. 9:30-9:55 Introduction to Hyperbolic and Real Stable Polynomials expansion to the second smallest Organizer: Johann A. Makowsky Nikhil Srivastava, Microsoft Research, India eigenvalue of the graph Laplacian, and Technion - Israel Institute of Technology, provides an efficient method to check if a Israel 10:00-10:25 Stable Multivariate graph is an edge expander (i.e., has edge Polynomials and the Lower Bounds: Organizer: Andrew J. Goodall (old)Results and (new)Conjectures expansion is at least some constant). In Charles University, Czech Republic this talk, we survey recent developments Leonid Gurvits, City College of CUNY, USA Organizer: Joanna Ellis- on the following lines: 10:30-10:55 Stable Multivariate Monaghan Eulerian Polynomials 1. What is the analog of expansion for Saint Michael’s College, USA Mirko Visontai, Google, Inc., USA partitioning a graph into multiple parts 2:45-3:10 Graph Polynomials from 11:00-11:25 Hyperbolic Polynomials, (more than 2), and how does Cheeger’s Graph Homomorphisms Interlacers, and Sums of Squares inequality generalize? Delia Garijo, University of Sevilla, Spain; Cynthia Vinzant, University of Michigan, 2. Is there a Cheeger-type inequality for Andrew J. Goodall and Jaroslav Nesetril, Charles University, Czech Republic USA vertex expansion? How to efficiently 11:30-11:55 Title Not Available at Time verify whether a graph is a vertex 3:15-3:40 On the Location of the of Publication expander? Roots of Graph Polynomials Robin Pemantle, University of Pennsylvania, Johann A. Makowsky, Technion - Israel USA 3. Do there exist algorithms with better Institute of Technology, Israel; Elena performance? Ravve, ORT Braude College, Israel; 4. How do these parameters, inequalities Nicolas Blanchard, ENS, France and algorithms extend to hypergraphs? 3:45-4:10 On the Largest Real Root Lunch Break Santosh Vempala of the Independence Polynomials of Trees 12:00 PM-1:30 PM Georgia Institute of Technology, USA Attendees on their own continued on next page Coffee Break 2:15 PM-2:45 PM Room:Greenway Promenade 2014 SIAM Conference on Discrete Mathematics 31

Mohammad Reza Oboudi, University of Thursday, June 19 Thursday, June 19 Isfahan, Iran 4:15-4:40 On the Complexity of MS44 MS45 Various Ising Polynomials Points and Lines in Metric Pursuit Games on Graphs - Tomer Kotek, Vienna University of Technology, Austria Spaces and Hypergraphs Part II of II 4:45-5:10 The Complexity of Counting 2:45 PM-5:15 PM 2:45 PM-5:15 PM Edge Colorings and a Dichotomy Room:Greenway A Room:Greenway I for Some Higher Domain Holant Problems Every noncollinear set of n points in For Part 1 see MS15 Jin-Yi Cai, Heng Guo, and Tyson Williams, the plane determines at least n distinct Pursuit games on graphs originated University of Wisconsin, Madison, USA lines. Line uv in the plane consists of in the early eighties with the all points p such that dist(p, u)+dist(u, introduction of the Game of Cops and v)=dist(p, v) or dist(u, p)+dist(p, Robbers. Since then, researchers have v)=dist(u, v) or dist(u, v)+dist(v, investigated a variety of pursuit games p)=dist(u, p); with this definition of of focussed on capture, containment line uv in an arbitrary metric space (V, or control of an adversary. The last dist), Chen and Chvatal conjectured decade has witnessed a wealth of in 2006 that every metric space on n pursuit game results in structural, points, where n is at least 2, has at least probabilistic and algorithmic graph n distinct lines or a line that consists theory. This minisymposium will bring of all n points. The minisymposium together leading researchers in the field will survey results supporting this to discuss state-of-the-art work on the conjecture. subject. Organizer: Vasek Chvatal Organizer: Andrew J. Beveridge Concordia University, Canada Macalester College, USA Organizer: Xiaomin Chen 2:45-3:10 The Computational Shanghai Jianshi LTD, China Complexity of Cops and Robbers Bill Kinnersley, Ryerson University, Canada 2:45-3:10 Lines in Metric Spaces and 3:15-3:40 The Eternal Dominating Set Hypergraphs: A Survey Problem on Grids Xiaomin Chen, Shanghai Jianshi LTD, China Margaret-Ellen Messinger, Mount Allison 3:15-3:40 Points, Lines, and the University, Canada Manhattan Metric 3:45-4:10 Lazy Cops and Robbers Ida Kantor, Charles University, Czech Deepak Bal, Anthony Bonato, Bill Republic; Balazs Patkos, Renyi Institute, Kinnersley, and Pawel Pralat, Ryerson Hungary University, Canada 3:45-4:10 A De Bruijn-Erdos Theorem 4:15-4:40 Cop Versus Gambler for Distance-hereditary Graphs Natasha Komarov, Carnegie Mellon Rohan Kapadia and Pierre Aboulker, University, USA Concordia University, Canada 4:45-5:10 Line-of-Sight Pursuit in 4:15-4:40 Lines in Metric Spaces Sweepable Polygons Induced by General Graphs Andrew J. Beveridge, Macalester College, Cathryn Supko, Concordia University, USA Canada 4:45-5:10 A New Generalisation of a de Bruijn Erdos Theorem Pierre Aboulker, Concordia University, Canada; Stephan Thomassé, ENS Lyon, France 32 2014 SIAM Conference on Discrete Mathematics

Thursday, June 19 Thursday, June 19 Thursday, June 19 MS46 CP8 CP9 Graph Theory Graphs Optimization 2:45 PM-5:15 PM 2:45 PM-4:45 PM 2:45 PM-4:45 PM Room:Greenway J Room:Greenway B Room:Skyway A This minisymposium contains talks on Chair: Ralph Faudree, University of Chair: Csaha D. Toth, California State various problems in graph theory. Memphis, USA University, Northridge, USA Organizer: Alexandr Kostochka 2:45-3:00 Some Problems on Paths 2:45-3:00 On the Stable University of Illinois at Urbana-Champaign, and Cycles Matchings That Can Be Reached Chunhui Lai, Minnan Normal University, USA When the Agents Go Marching in China 2:45-3:10 Kekulean Benzenoids One by One Elizabeth Hartung, Massachusetts College of 3:05-3:20 Signed Edge Domination Christine T. Cheng, University of Wisconsin, Liberal Arts, USA; Jack Graver, Syracuse Numbers of Complete Tripartite Milwaukee, USA University, USA Graphs Abdollah Khodkar, University of West 3:05-3:20 The Minimum Number of 3:15-3:40 On r-dynamic Coloring of Georgia, USA; Arezoo Nazi Ghameshlou, Hubs Needed in Networks Graphs University of Tehran, Iran Easton Li Xu and Guangyue Han, University Sogol Jahanbekam, University of Colorado, of Hong Kong, Hong Kong Denver, USA; Jaehoon Kim, University 3:25-3:40 On the Centralizing Number 3:25-3:40 Discrete Tropical of Illinois, USA; Suil O, Georgia State of Graphs Sarah L. Behrens and Stephen Hartke, Optimization Problems University, USA; Douglas B. West, University of Nebraska, Lincoln, USA Nikolai Krivulin, St Petersburg State Zhejiang Normal University, China and University, Russia University of Illinois, USA 3:45-4:00 A Result on Clique Convergence for Join of Graphs 3:45-4:00 Characterization of 3:45-4:10 Split Graphs and Nordhaus- V. V. P. R. V. B. Suresh Dara and S. M. Convex Sets Which Are Semidefinite Gaddum Graphs Hegde, National Institute of Technology Representable at Infinity Ann N. Trenk, Wellesley College, USA; Karnataka , Surathkal, India Anusuya Ghosh and Vishnu Narayanan, Karen Collins, Wesleyan University, USA Indian Institute of Technology-Bombay, 4:05-4:20 Modified Regular Line 4:15-4:40 Counting Split Graphs and India Digraphs for Optimal Connectivity Nordhaus-Gaddum Graphs and Small Diameters 4:05-4:20 Deriving Compact Karen Collins, Wesleyan University, USA; Prashant D. Joshi, Intel Corporation, USA; Extended Formulations via LP-based Ann N. Trenk, Wellesley College, USA Said Hamdioui, Delft University of Separation Techniques 4:45-5:10 Dichromatic Number and Technology, Netherlands Giuseppe Lancia and Paolo Serafini, Fractional Chromatic Number and University of Udine, Italy 4:25-4:40 Deciding the Bell Number Hehui Wu and Bojan Mohar, Simon Fraser for Hereditary Graph Classes 4:25-4:40 Finding the Minimum Value University, Canada Jan Foniok, Aistis Atminas, Andrew Collins, of a Vector Function Using Lipschitz and Vadim Lozin, University of Warwick, Condition United Kingdom Ibraheem Alolyan, King Saud University, Saudia Arabia 2014 SIAM Conference on Discrete Mathematics 33

Thursday, June 19 CP10 Combinatorics 2:45 PM-5:05 PM Room:Skyway B Chair: Marni Mishna, Simon Fraser University, Canada 2:45-3:00 Pattern Occurrence Statistics and Applications to the Ramsey Theory of Unavoidable Patterns Francine Blanchet-Sadri, University of North Carolina, USA; Jim Tao, Princeton University, USA 3:05-3:20 Minimal Partial Languages and Automata Francine Blanchet-Sadri, University of North Carolina, USA; Kira Goldner, Oberlin College, USA; Aidan Shackleton, Swarthmore College, USA 3:25-3:40 On Minimal Partial Words with Subword Complexity 2n Francine Blanchet-Sadri, University of North Carolina, USA; Mark Heimann, University of Washington in St. Louis, USA; Andrew Lohr and Katie McKeon, Rutgers University, USA 3:45-4:00 Tight Bounds on Number of Primitively-Rooted Squares in Partial Words Francine Blanchet-Sadri, University of North Carolina, USA; Jordan Nikkel, Vanderbilt University, USA; James Quigley, University of Illinois at Urbana- Champaign, USA; Xufan Zhang, Princeton University, USA 4:05-4:20 A Variation of the Instant Insanity Puzzle Steven J. Winters, University of Wisconsin, Oshkosh, USA 4:25-4:40 Keeping Avoider’s Graph Almost Acyclic Julia Ehrenmueller, Hamburg University of Technology, Germany; Dennis Clemens, Freie Universität Berlin, Germany; Yury Person, University of Frankfurt, Germany; Tuan Tran, Freie Universität Berlin, Germany 4:45-5:00 The Relationships Between the Bernaulli Numbers B2n & An and the Euler Numbers E2n & Bn Mohammed R. Karim, Alabama A&M University, USA 34 2014 SIAM Conference on Discrete Mathematics

Notes 2014 SIAM Conference on Discrete Mathematics 35

Abstracts vid Eppstein from SIDMA 24-4 , Da or Chepoi, Hans-Juergen Bandelt or Chepoi, Vict June 16-19, 2014 Hyatt Regency Minneapolis Minneapolis, Minnesota, USA Figure courtesy Figure

Abstracts are printed as submitted. 5836 2014 SIAM Conference on Discrete Mathematics

Notes 2014 SIAM Conference on Discrete Mathematics 87

Or­ganizer and Speaker Index vid Eppstein from SIDMA 24-4 , Da or Chepoi, Hans-Juergen Bandelt or Chepoi, Vict June 16-19, 2014 Hyatt Regency Minneapolis Minneapolis, Minnesota, USA Figure courtesy Figure 88 2014 SIAM Conference on Discrete Mathematics

A C Dukes, Peter, MS21, 5:15 Tue Aboulker, Pierre, MS44, 4:45 Thu Cameron, Kathie, MS35, 3:15 Wed Dutta, Tarini K., CP6, 4:15 Wed Alolyan, Ibraheem, CP9, 4:25 Thu Cameron, Kathie, MS35, 3:15 Wed Dvorak, Zdenek, MS9, 3:15 Mon Alon, Noga, IP5, 8:45 Wed Carrel, Sean, MS32, 10:00 Wed Dvorak, Zdenek, MS9, 3:15 Mon Anstee, Richard P., MS17, 10:30 Tue Chaidez, Julian, CP3, 4:15 Mon Dvorak, Zdenek, MS27, 10:00 Wed Arsuaga, Javier, MS41, 10:30 Thu Chaplick, Steven, MS23, 3:15 Tue Dvorak, Zdenek, MS37, 9:30 Thu Dyer, Danny, MS15, 11:00 Tue Asaf, Ferber, MS3, 10:30 Mon Chaplick, Steven, MS23, 3:15 Tue Axenovich, Maria, MS37, 11:30 Thu Chen, Guantao, MS16, 10:00 Tue E Chen, Guantao, MS16, 10:00 Tue Ehrenmueller, Julia, CP10, 4:25 Thu B Chen, Guantao, MS30, 10:00 Wed Ellingham, Mark, MS30, 10:00 Wed B. Suresh Dara, V. V. P. R. V., CP8, Chen, Min, MS9, 4:15 Mon 3:45 Thu Ellis-Monaghan, Joanna, MS12, 10:00 Tue Chen, Xiaomin, MS44, 2:45 Thu Bailey, Sean, CP3, 4:55 Mon Ellis-Monaghan, Joanna, MS43, 2:45 Thu Chen, Xiaomin, MS44, 2:45 Thu Bal, Deepak, MS45, 3:45 Thu Erbes, Catherine, MS40, 11:00 Thu Cheng, Christine T., CP9, 2:45 Thu Barghi, Amir, MS15, 11:30 Tue Erey, Aysel, MS4, 10:00 Mon Chin, Alex, CP1, 3:15 Mon Barrus, Michael D., MS40, 10:00 Thu Eroh, Linda, CP5, 4:35 Wed Choi, Jihoon, CP4, 3:55 Wed Behrens, Sarah L., CP8, 3:25 Thu Chowdhury, Ameera, MS17, 12:00 Tue F belcastro, sarah-marie, MS18, 10:00 Tue Faudree, Ralph, MS16, 10:30 Tue Chung-Graham, Fan, MS11, 4:15 Mon Bennett, Patrick, MS26, 10:00 Wed Ferrara, Michael, MS40, 9:30 Thu Chvatal, Vasek, MS44, 2:45 Thu Bernardi, Olivier, MS32, 10:00 Wed Ferrara, Michael, MS40, 9:30 Thu Clarke, Nancy E., MS15, 12:00 Tue Beveridge, Andrew J., MS15, 10:00 Tue Fitzpatrick, Shannon L., MS15, 10:30 Clisby, Nathan, MS41, 10:00 Thu Beveridge, Andrew J., MS45, 2:45 Thu Tue Collins, Karen, MS46, 4:15 Thu Beveridge, Andrew J., MS45, 4:45 Thu Foniok, Jan, CP8, 4:25 Thu Conlon, David, MS1, 10:30 Mon Blanchet-Sadri, Francine, CP10, 3:25 Foucaud, Florent, MS6, 11:30 Mon Conlon, David, MS8, 3:45 Mon Thu Fox, Jacob, IP1, 8:45 Mon Boehnlein, Edward, MS5, 12:00 Mon Cooper, Joshua, MS29, 10:30 Wed Fox, Jacob, MS8, 3:15 Mon Bohman, Thomas, MS26, 10:00 Wed Cowen, Lenore J., MS13, 10:00 Tue Fox, Jacob, MS36, 9:30 Thu Bohman, Thomas, MS33, 3:15 Wed Cowen, Lenore J., MS13, 10:00 Tue Fox, Jacob, MS36, 11:00 Thu Bonamy, Marthe, MS37, 10:30 Thu Cranston, Daniel, MS37, 9:30 Thu Frieze, Alan, MS33, 5:15 Wed Bonato, Anthony, MS15, 10:00 Tue Czabarka, Eva, MS5, 10:00 Mon Boutin, Debra L., MS6, 12:00 Mon Czabarka, Eva, MS5, 11:00 Mon G Geelen, Jim, IP2, 2:00 Mon Bradonjic, Milan, CP1, 3:35 Mon Czygrinow, Andrzej M., CP5, 3:35 Wed Brewster, Richard, MS6, 10:00 Mon Ghosh, Anusuya, CP9, 3:45 Thu Brewster, Richard, MS6, 10:00 Mon D Glebov, Roman, MS22, 3:15 Tue Das, Ashok K., CP6, 4:35 Wed Brown, David E., CP5, 4:55 Wed Goaoc, Xavier, MS10, 3:15 Mon Diaz-Castro, Jorge, CP2, 5:15 Mon Bukh, Boris, MS10, 3:15 Mon Goddard, Wayne, CP7, 4:55 Wed Diemunsch, Jennifer, CP5, 4:15 Wed Bukh, Boris, MS10, 3:45 Mon Goldberg, Debra, MS13, 10:30 Tue Dolega, Maciej, MS32, 10:30 Wed Bukh, Boris, MS14, 10:00 Tue Goldner, Kira, CP10, 3:05 Thu Dudek, Andrzej, MS8, 5:15 Mon Buratti, Marco, MS21, 3:45 Tue Goodall, Andrew J., MS12, 10:00 Tue Duffus, Dwight, MS25, 5:15 Tue Goodall, Andrew J., MS43, 2:45 Thu

Italicized names indicate session organizers. 2014 SIAM Conference on Discrete Mathematics 89

Goodall, Andrew J., MS43, 2:45 Thu J Kral, Daniel, MS22, 3:15 Tue Gould, Ronald, MS16, 11:00 Tue Jacobson, Sheldon H., CP2, 4:55 Mon Kral, Daniel, MS22, 4:45 Tue Graham, Ron, MS26, 10:30 Wed Janse van Rensburg, EJ, MS24, 3:15 Kratochvil, Jan, MS23, 3:45 Tue Greenhill, Catherine, MS5, 10:30 Mon Tue Kreher, Donald L., MS21, 4:45 Tue Griggs, Jerry, MS7, 10:00 Mon Jiang, Guangfeng, CP3, 3:55 Mon Krivelevich, Michael, MS3, 10:00 Mon Griggs, Jerry, MS7, 11:30 Mon Jiang, Tao, MS17, 10:00 Tue Krivulin, Nikolai, CP9, 3:25 Thu Griggs, Jerry, MS25, 3:15 Tue Jiang, Tao, MS17, 10:00 Tue Kuang, Rui, MS13, 11:30 Tue Grinshpun, Andrey, MS8, 3:15 Mon Joeris, Benson, MS20, 4:15 Tue Kuhn, Daniela, IP7, 8:15 Thu Grinshpun, Andrey, MS36, 9:30 Thu Johnston, Nathaniel D., CP2, 4:15 Mon Kwon, O-Joung, CP6, 4:55 Wed Grinshpun, Andrey, MS36, 9:30 Thu Joret, Gwenael, MS25, 3:45 Tue Gurvits, Leonid, MS42, 10:00 Thu Joshi, Prashant D., CP8, 4:05 Thu L La Croix, Michael A., MS32, 12:00 H K Wed Han, Hiep, MS36, 11:30 Thu Kalita, Debajit, CP4, 3:15 Wed Laekhanukit, Bundit, MS4, 12:00 Mon Han, Jie, CP5, 5:15 Wed Kantor, Ida, MS44, 3:15 Thu Lai, Chunhui, CP8, 2:45 Thu Hartke, Stephen, MS40, 11:30 Thu Kapadia, Rohan, MS44, 3:45 Thu Lam, Thomas, MS2, 10:30 Mon Hartung, Elizabeth, MS46, 2:45 Thu Karim, Mohammed R., CP10, 4:45 Thu Lavrov, Mikhail, MS26, 11:30 Wed Harutyunyan, Ararat, CP7, 4:35 Wed Katona, Gyula, MS7, 10:00 Mon Lee, Choongbum, MS1, 11:00 Mon Hatami, Hamed, MS22, 3:45 Tue Katona, Gyula, MS39, 9:30 Thu Lee, Choongbum, MS8, 4:15 Mon Haxell, Penny, MS26, 11:00 Wed Keevash, Peter, IP0, 8:00 Mon Lee, Sang June, MS39, 9:30 Thu Hefetz, Dan, MS3, 10:00 Mon Kenter, Franklin, MS29, 11:30 Wed Lemons, Nathan, CP1, 4:35 Mon Hefetz, Dan, MS3, 12:00 Mon Kenyon, Richard, MS2, 10:00 Mon Li, Wei-Tian, MS7, 11:00 Mon Heise, Carl Georg, CP5, 3:55 Wed Kenyon, Richard, MS34, 3:15 Wed Lidicky, Bernard, MS22, 5:15 Tue Hell, Pavol, MS35, 4:15 Wed Kenyon, Richard, MS34, 4:45 Wed Liebenau, Anita, MS3, 10:00 Mon Hoffman, Christopher, MS11, 3:45 Mon Khot, Subhash, MS28, 10:00 Wed Lih, Ko-Wei, CP7, 4:15 Wed Hogan, Emilie, CP2, 3:55 Mon Khot, Subhash, MS28, 10:00 Wed Lin, Wu-Hsiung, CP7, 3:15 Wed Hogben, Leslie, MS29, 12:00 Wed Kim, Seog-Jin, CP7, 3:35 Wed Lindner, Charles C., MS21, 3:15 Tue Hough, Robert, IP3, 8:45 Tue Kim, Younjin, CP1, 4:15 Mon Liu, Chun-hung, MS27, 12:00 Wed Howard, David M., MS20, 4:45 Tue Kinnersley, Bill, MS45, 2:45 Thu Lo, Allan, MS19, 4:45 Tue Huang, Hao, MS17, 11:30 Tue Kobayashi, Yusuke, MS20, 5:15 Tue Loh, Po-Shen, MS26, 10:00 Wed Huang, Hao, MS22, 4:15 Tue Komarov, Natasha, MS45, 4:15 Thu Loh, Po-Shen, MS33, 3:15 Wed Huang, Shenwei, MS35, 3:45 Wed Koranne, Sandeep, CP2, 4:35 Mon Lu, Linyuan, MS7, 10:30 Mon Hull, Thomas, CP4, 4:55 Wed Kortchemski, Igor, MS32, 11:30 Wed Lu, Linyuan, MS29, 11:00 Wed Hutchinson, Joan P., MS18, 10:00 Tue Kostochka, Alexandr, MS1, 10:00 Mon M Huynh, Tony, MS27, 10:30 Wed Kostochka, Alexandr, MS46, 2:45 Thu Ma, Jie, MS26, 12:00 Wed Kotek, Tomer, MS43, 4:15 Thu MacGillivrary, Gary, MS6, 10:00 Mon I Koyuturk, Mehmet, MS13, 11:00 Tue Iliev, Gary K., MS31, 12:00 Wed MacGillivrary, Gary, MS6, 10:30 Mon Kozik, Jakub, MS36, 10:30 Thu Madras, Neal, MS41, 9:30 Thu Magliveras, Spyros S., MS21, 4:15 Tue

Italicized names indicate session organizers. 90 2014 SIAM Conference on Discrete Mathematics

Mahdian, Mohammed, MS18, 11:30 Tue Osthus, Deryk, MS1, 12:00 Mon S Mahmoodian, Ebadollah S., MS18, Osthus, Deryk, MS19, 3:15 Tue Saito, Akira, MS30, 11:00 Wed 12:00 Tue Ota, Katsuhiro, MS16, 11:30 Tue Samal, Robert, MS4, 11:00 Mon Makowsky, Janos, MS12, 10:00 Tue Oum, Sang-Il, MS20, 3:45 Tue Samotij, Wojciech, SP1, 8:00 Wed Makowsky, Johann A., MS12, 10:00 Tue Owczarek, Aleks, MS31, 10:30 Wed Samotij, Wojciech, MS19, 3:45 Tue Makowsky, Johann A., MS43, 2:45 Thu Ozeki, Kenta, MS27, 11:30 Wed Schacht, Mathias, MS1, 11:30 Mon Maleki, Zeinab, MS39, 10:00 Thu Ozkahya, Lale, CP1, 4:55 Mon Schacht, Mathias, MS8, 3:15 Mon Malic, Goran, CP3, 3:15 Mon Schaefer, Marcus, MS23, 5:15 Tue Marcus, Adam, IP6, 2:00 Wed P Schmitt, John, MS38, 11:30 Thu Marcus, Adam, MS11, 4:45 Mon Panova, Greta, MS2, 10:00 Mon Schreyer, Jens, CP6, 3:15 Wed Martin, Ryan R., MS7, 12:00 Mon Papadimitriou, Dimitri, MS4, 11:30 Mon Sen, Subhabrata, CP1, 3:55 Mon Matsumoto, Naoki, CP6, 3:55 Wed Pegden, Wesley, MS3, 11:30 Mon Serafini, Paolo, CP9, 4:05 Thu Mertzios, George B., MS23, 4:15 Tue Pegden, Wesley, MS34, 4:15 Wed Sergey, Norin, MS22, 3:15 Tue Messinger, Margaret-Ellen, MS45, 3:15 Pemantle, Robin, MS42, 11:30 Thu Shan, Songling, MS30, 12:00 Wed Thu Peng, Xing, MS19, 5:15 Tue Simon, Steven, CP4, 4:35 Wed Milans, Kevin, MS25, 4:15 Tue Perarnau, Guillem, MS39, 10:30 Thu Skokan, Jozef, MS8, 4:45 Mon Mishna, Marni, MS24, 4:45 Tue Perkins, Will, MS33, 4:45 Wed Skrabulakova, Erika, MS9, 5:15 Mon Morgan, Kerri, MS12, 10:30 Tue Person, Yury, MS19, 4:15 Tue Smith, Ben, MS38, 10:30 Thu Morrisey, Thomas, CP2, 3:15 Mon Petrovic, Sonja, MS5, 11:30 Mon Soberón, Pablo, MS10, 4:15 Mon Moshkovitz, Dana, MS28, 11:00 Wed Pfender, Florian, MS30, 10:30 Wed Solymosi, Jozsef, MS14, 12:00 Tue Moshkovitz, Guy, MS33, 3:15 Wed Pike, David A., MS38, 11:00 Thu Soteros, Christine, MS24, 3:15 Tue Muller, Tobias, MS3, 11:00 Mon Pirzada, Shariefuddin, CP4, 3:35 Wed Soteros, Christine, MS31, 10:00 Wed Myers, Chad, MS13, 12:00 Tue Poole, Daniel J., MS39, 11:00 Thu Soteros, Christine, MS41, 9:30 Thu Postle, Luke, MS37, 11:00 Thu Soteros, Christine, MS41, 11:00 Thu N Prellberg, Thomas, MS24, 3:45 Tue Naismith, Katie, MS35, 5:15 Wed Soto Garrido, Rodrigo A., MS2, 11:30 Pylyavskyy, Pavlo, MS2, 11:00 Mon Nakamoto, Atsuhiro, MS18, 10:30 Tue Mon Naserasr, Reza, MS6, 11:00 Mon R Sparks, Athena C., MS10, 4:45 Mon Nastase, Esmeralda L., CP3, 5:15 Mon Radcliffe, Mary, MS11, 3:15 Mon Sritharan, R., MS35, 4:45 Wed Nazi Ghameshlou, Arezoo, CP8, 3:05 Radcliffe, Mary, MS29, 10:00 Wed Srivastava, Nikhil, MS42, 9:30 Thu Thu Radcliffe, Mary, MS29, 10:00 Wed Srivastava, Nikhil, MS42, 9:30 Thu Negami, Seiya, MS18, 11:00 Tue Raghavendra, Prasad, MS28, 10:00 Wed Stacho, Juraj, MS4, 10:30 Mon Nguyen, Hoi, MS33, 4:15 Wed Raghavendra, Prasad, MS28, 11:30 Wed Steurer, David, MS28, 10:30 Wed Nikkel, Jordan, CP10, 3:45 Thu Randall, Dana, MS34, 3:45 Wed Striker, Jessica, MS2, 12:00 Mon Noel, Jonathan A., MS37, 10:00 Thu Rattan, Amarpreet, MS32, 11:00 Wed Sumners, De Witt L., MS24, 4:15 Tue Norin, Sergey, MS4, 10:00 Mon Ravve, Elena, MS43, 3:15 Thu Sun, Nike, MS34, 3:15 Wed Norin, Sergey, MS27, 11:00 Wed Rawdon, Eric, MS41, 11:30 Thu Supko, Cathryn, MS44, 4:15 Thu Norin, Sergey, MS33, 3:45 Wed Rechnitzer, Andrew, MS31, 11:30 Wed Szekely, Laszlo, MS5, 10:00 Mon Nyaare, Benard O., CP2, 3:35 Mon Richter, David, CP6, 3:35 Wed Rivin, Igor, MS14, 11:00 Tue T Tancer, Martin, MS14, 10:00 Tue O Rosa, Alexander, MS21, 3:15 Tue Oboudi, Mohammad Reza, MS43, 3:45 Tao, Jim, CP10, 2:45 Thu Rosa, Alexander, MS38, 9:30 Thu Thu Tittmann, Peter, MS12, 11:00 Tue Rosa, Alexander, MS38, 9:30 Thu Osthus, Deryk, MS1, 10:00 Mon Tokushige, Norihide, MS25, 4:45 Tue

Italicized names indicate session organizers. 2014 SIAM Conference on Discrete Mathematics 91

Toroczkai, Zoltan, MS5, 10:00 Mon Young, Stephen J., MS11, 3:15 Mon Toth, Csaba D., MS14, 10:30 Tue Young, Stephen J., MS11, 3:15 Mon Traetta, Tommaso, CP5, 3:15 Wed Young, Stephen J., MS29, 10:00 Wed Trenk, Ann N., MS46, 3:45 Thu Yu, Xingxing, MS30, 10:00 Wed Trotter, William T., MS25, 3:15 Tue Z Tsuchiya, Shoichi, MS16, 12:00 Tue Zahl, Josh, MS14, 11:30 Tue Tulsiani, Madhur, MS28, 12:00 Wed Zamora, Jose, MS12, 11:30 Tue Tymkew, Joshua B., CP3, 4:35 Mon Zhao, Yi, MS19, 3:15 Tue V Vazquez, Mariel, MS31, 11:00 Wed Vempala, Santosh, IP8, 1:30 Thu Verstraete, Jacques, MS17, 11:00 Tue Verstraete, Jacques, MS36, 10:00 Thu Vince, Andrew, CP4, 4:15 Wed Vinzant, Cynthia, MS42, 11:00 Thu Visontai, Mirko, MS42, 10:30 Thu Volec, Jan, MS9, 3:45 Mon Vondrak, Jan, IP4, 2:00 Tue W Walczak, Bartosz, MS23, 4:45 Tue Wanless, Ian, MS38, 10:00 Thu Wenger, Paul, MS40, 10:30 Thu West, Douglas B., MS46, 3:15 Thu Whittington, Stuart, MS31, 10:00 Wed Williams, Tyson, MS43, 4:45 Thu Wilson, David B., MS34, 5:15 Wed Winters, Steven J., CP10, 4:05 Thu Wollan, Paul, MS20, 3:15 Tue Wollan, Paul, MS20, 3:15 Tue Wollan, Paul, MS27, 10:00 Wed Wong, Thomas, MS24, 5:15 Tue Wong, Wing Hong Tony, CP3, 3:35 Mon Wu, Hehui, MS46, 4:45 Thu X Xu, Easton Li, CP9, 3:05 Thu Y Yancey, Matthew, MS9, 4:45 Mon Yang, Ping, MS30, 11:30 Wed Yerger, Carl, CP7, 3:55 Wed

Italicized names indicate session organizers. 92 2014 SIAM Conference on Discrete Mathematics

Notes 2014 SIAM Conference on Discrete Mathematics 93

DM14 Budget

Conference Budget SIAM Conference on Discrete Mathematics June 16-19, 2014 Minneapolis, MN

Expected Paid Attendance 340

Revenue Registration Income $100,175 Total $100,175

Expenses Printing $2,500 Organizing Committee $3,800 Invited Speakers $10,500 Food and Beverage $24,000 AV Equipment and Telecommunication $13,200 Advertising $4,400 Conference Labor (including benefits) $40,504 Other (supplies, staff travel, freight, misc.) $7,400 Administrative $10,195 Accounting/Distribution & Shipping $5,006 Information Systems $8,952 Customer Service $3,316 Marketing $5,148 Office Space (Building) $2,811 Other SIAM Services $3,187 Total $144,919

Net Conference Expense -$44,744

Support Provided by SIAM $44,744 $0

Estimated Support for Travel Awards not included above:

Early Career and Students 27 $18,150 94 2014 SIAM Conference on Discrete Mathematics

FSC logo text box indicating size & layout of logo. Conlins to insert logo.