Atlas Mathematical Conference Abstracts || Conferences | Abstracts | for Organizers | About AMCA

Horizons in Combinatorics/16th Shanks Lecture Series
May 21-24, 2001
Vanderbilt University
Nashville, TN, USA

Organizers
Paul Edelman, Mark Ellingham, Jonathan Farley, Mike Plummer, Jerry Spinrad

Conference Homepage

Abstracts

Invited talks

Jeff Kahn Random independent sets
Éva Tardos Classification with pairwise relationships
Robin Thomas Decomposing Berge graphs
Bjarne Toft Hadwiger's Conjecture - then and now
W. T. (Tom) Trotter Geometric aspects of partially ordered sets
W. T. (Tom) Trotter The top ten theorems on partially ordered sets
Peter Winkler Graph homomorphisms and long range action

Contributed talks

Faisal Abu-Khzam On the Disk Dimension of Planar Graphs
N. Ananchuen Factor Criticality and Complete Closure of Graphs
Watcharaphong Ananchuen On graphs and digraphs with prescribed properties
Kiyoshi Ando On minimally 5-contraction critical graphs
Peter Blanchard On Regressive Ramsey Numbers
Tom Bohman A limit theorem for the shannon capacities of odd cycles
Anthony Bonato The pigeonhole property and orientations of the infinite random graph
Richard Brewster Packing Paths in Digraphs
Jason I. Brown A Taste of Chromatic Roots: Theta Graphs
Alewyn P Burger A graph theoretic problem concerning lotteries
Naiomi T. Cameron Results for Generalized Catalan Problems
Rod Canfield The maximum Stirling number(s) of the second kind
Zhongyuan Che Construction of Cores
Kari Chopra A Graph Theoretic Approach to Automated Consensus Building
Karen L. Collins The No-Homomorphism Lemma
Guoli Ding Splitter theorems for 3- and 4-regular graphs
Yoshimi Egawa 5-Shredders in 5-Connected Graphs
Linda Eroh Bipartite Rainbow Ramsey Numbers
Elaine M. Eschen Planar Domination Graphs
Jonathan David Farley Posets with the Same Number of Order Ideals of Each Cardinality: a problem from Stanley's ``Enumerative Combinatorics''
John Frederick Fink Different shades of Gray: (n, m)-Gray codes and quasi-cubes
Mark Fitch Allowable Sequences Arising from Double Polygons
Anant Godbole Almost all random graphs are cordial
Ahmed Hamadi Coloring perfect quasi-adjoin graphs
Bert Hartnell Minimum Dominating Walks in Cartesian Product Graphs
Rajneesh Hegde Finding 3-shredders efficiently
Chính T. Hoàng On the divisibility of graphs and intersection graphs
Jonathan K. Hodge Separable Relations on Cartesian Product Sets
Wilfried Imrich Fast recognition of classes of partial cubes
Garth Isaak Sum List Coloring 2 by n Arrays
Robert E. Jamison Constrained Ramsey numbers of graphs
Tao Jiang Vertex-disjoint cycles through specified vertices
P.D. Johnson, Jr. Relations among some fractional list coloring parameters and corresponding squishy-set coloring parameters
Atsushi Kaneko Partitioning Multipartite Complete Graphs by Monochromatic Trees
Ken-ichi Kawarabayashi Connected spanning subgraphs in surfaces with high representativity
Seog-Jin Kim Isometric Cycles and bridged graphs
Sandi Klavzar Cubes polynomial and its derivatives
Renu Laskar On Some Coloring Concepts in Graphs: A Brief Survey
Xuechao Li Chords of longest circuits of graphs embedded in torus or Klein bottle
Rong Luo Edge coloring of embeddable graphs and edge-face coloring of simple plane graphs
Gary MacGillivray Pushing the cycles out of directed graphs
Lynnell S. Matthews On Combinatorial Interpretations of Hankel Matrices and Their Determinants
David W Matula Hamiltonian Triangulated Toroidal Graphs
Greg McColm Ramsey Numbers on Posets (of Boolean Algebras)
Balazs Montagh Anti-Ramsey theorems on big double stars and on long paths
Amy Myers Counting Permutations by their Rigid Patterns
C. M. Mynhardt Increasing the upper irredundance number of a graph by adding edges
R. J. Nowakowski Well-covered weightings of graphs
Bogdan Oporowski Partitioning into two graphs with only small components
Ioannis Papoutsakis Graphs that admit a unique tree t-spanner
Michael Pelsmajer Graph Minors and Reliable Single Message Transmission
Tiang Poomsa-ard The maximum number of edges in a diameter 2-critical graph
Robert W. Robinson Counting Identity Graphs and Digraphs of Minimum Size
G. Sabidussi Deeply asymmetric planar graphs
Robin Sue Sanders Graph models for the conformations of ion channel proteins
Bill Sands Finite distributive lattices and the splitting property
Bernd Schroeder N-free ordered sets are reconstructible
Suk Jai Seo On Optimal Acyclic Orientations of a Unicyclic Graph
Lou Shapiro Random walks and the Pell numbers
Jian Shen Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs
Yingwen Tang Finding a maximum induced matching in weakly chordal graphs
Ann N Trenk Comparability Invariance Results for Tolerance Orders
Morimasa Tsuchiya On bound graphs and posets
Dirk Vertigan Near duality of circular coloring and circular flow in orientable surfaces.
Nisheeth Vishnoi Connected Graphs with Specified Degree Sequences
Heinz-Jürgen Voss Light subgraphs in large maps on compact 2-manifolds of minimum degree 5 .
Douglas B. West Pre-coloring extension for circular colorings
Wen Jin Woan Catalan Type Lattice Paths
Kiyoshi Yoshimoto The Connectivities of Trunk Graphs of 2-Connected Graphs
Raphael Yuster The decomposition threshold for bipartite graphs with minimum degree one
C. Q. Zhang Nowhere-zero 4-flows, simultaneous edge-colorings, and critical partial Latin squares-the proof of a Keedwell-Cameron Conjecture
Ying Zhang Expected Value of The Independence Number
Yue Zhao Planar graphs of maximum degree seven are class one


© 2009 Atlas Mathematical Conference Abstracts