IMI Interdisciplinary Mathematics InstituteCollege of Arts and Sciences


28th Cumberland Conference on Combinatorics, Graph Theory & Computing

May 15-17, 2015

(12:30p on May 15 to 12:30p on May 17th)
University of South Carolina
Columbia, SC 29208

Conference Poster

Conference Program

Day Lecture Time Gambrell 153 Gambrell 151 Gambrell 152 Gambrell 250
Fri 01:00 - 01:30 Linyuan Lincoln Lu
Welcome and Opening Remarks
Fri 01:30 - 02:00   Dan Cranston
Planar graphs are 9/2-colorable and have big independent sets
Ujwala Deshmukh
Cordial Labeling Of supersubdivision of Cyclic ladder and Quadrilateral Snake
Daniel Rorabaugh
Density Dichotomy in Random Words
Fri 02:00 - 02:30   Ann Clifton
Packing Chromatic Number of Random $d$-regular Graphs
Anahita Davoudi
Identifying Influential Nodes in Social Graphs
Anton Bernshteyn
The Local Action Lemma
Fri 02:30 - 03:00   Hua Wang
A small branch goes a long way: subtrees and distances...a slice of Székely's work and what it inspires
David Narváez
Redundancy Elimination in Proper $k$-level Hierarchies and Its Application in a Ramsey Construction
Carl Yerger
On three sets with nondecreasing diameter
Fri 03:00 - 03:30   László Székely
Some open problems
Bill Kay
The Chromatic Number of Generalized Shift Graphs
Fri 03:30 - 04:00     Edward Boehnlein
Computing Diffusion State Distance using Green's Function and Heat Kernel on Graphs
Aaron Dutle
Proving Program Termination with Matrix Weighted Digraphs
Fri 04:30 - 05:30 Gyula Katona
Largest families of sets, under conditions defined by a given poset
Fri 6:30 DINNER: The Flying Saucer / 931 Senate St. / (803)256-2055
Sat 08:30 - 09:00       Heather Smith
Complexity of weight functions on binary string medians
Sat 09:00 - 09:30   Peter Dankelmann
The Diameter of Graphs and Eulerian Digraphs
Michelle Delcourt
Infinite Families of Ramanujan Hypergraphs
Joshua Cooper
Pressing Sequences, Bicolored Graphs, and Binary Matrix Algebra
Sat 09:30 - 10:00   Kimberly Dsouza
A Chain Theorem for Quasi 4-Connected Graphs
Wei Li
Analytic connectivity of k-uniform hypergraphs
Xing Peng
On the stationary distribution of simple random walks on directed graphs
Sat 10:00 - 10:30   Kayvan Sadeghi
On the maximum number of non-zeros in graphical joint degree matrices
Nathan Reff
Spectral properties of oriented hypergraphs and a connection to the Hadamard conjecture
Travis Johnston
A Novel Method for In-Situ Analysis of Protein Folding Trajectories
Sat 11:00 - 12:00 Jozsef Balogh
On the applications of counting independent sets in hypergraphs
Sat 02:00 - 02:30   Kevin Milans
Monotone paths in an edge-ordered copy of $K_n$
Miklós Bóna
How far is a typical vertex of a rooted tree from the closest leaf
Rao Li
An Inequality on the Isoperimetric and $k$ - Domination Numbers of a Graph
Sat 02:30 - 03:00   Terry McKee
Strongly Distance-Hereditary Graphs
Garner Cochran
Generating Functions and Wilf Equivalence for Generalized Interval Embeddings
Thomas Lewis
Upper Distance-Two Domination
Sat 03:00 - 03:30   Honghai Xu
Vertex Colorings without Rainbow Subgraphs
  Yu-Fong Hsu
Four-Cycle Systems with Four-Regular Leaves
Sat 03:30 - 04:00   Chuanyun Zang
Minimum vertex degree threshold for tiling complete 3-partite 3-graphs
Gábor Hetyei
Cubical $h$-vectors, noncrossing partitions, and Catalan numbers
Mohammad Hailat
On the Structure of $(\lambda,\mu)$-Graphs
Sat 04:30 - 05:30 Jozsef Solymosi
Incidence Numbers and Hard Erdos Problems in Discrete Geometry
Sun 09:00 - 10:00 Catherine Yan
Many Faces of Parking Functions
Sun 10:30 - 11:00   Felix Lazebnik
New results for some families of algebraically defined graphs
Tri Lai
Lozenge tilings of hexagon with holes and plane partitions fitting in a special box
Kristin Heysse
A Cospectral Family of Graphs for the Normalized Laplacian Found by Toggling
Sun 11:00 - 11:30   Rupei Xu
Crossing Number, Sparse Graph Classes and Parameterized Complexity
Charles Burnette
Representing Random Permutations as a Product of Two Involutions
Steve Butler
Cospectral graphs with differing number of edges
Sun 11:30 - 12:00   Robert Jaeger
Coloring Squares of Planar Graphs with no 4-Cycles and no 5-Cycles
Matthew Just
Optimal Permutations in Restricted Permutation Sets
Linyuan Lincoln Lu
A combinatorial identity on Galton-Watson process
Sun 12:00 - 12:30     Esmeralda Nastase
The structure of the minimum size supertail of a subspace partition
Michael Schroeder
Latin Squares with Disjoint Subsquares
© Interdisciplinary Mathematics Institute | The University of South Carolina Board of Trustees | Webmaster