Hammer
to Algorithmic Graph Theory
comparability graphs
those that admit a transitive orientation (TRO)
of its edges
chordal graphs
those that have no chordless cycles 4
interval graphs
the intersection graphs of
intervals on a line
permutation graphs
the intersection graphs
of permutation diagrams
The hierarchy of graph classes
Perfect graphs
The answer was provided by Fldes and Hammer (1977): Split graphs
A graph G is a split graph if its vertices can be
partitioned into an independent set and a clique.
Let m = max {i | di i 1}
Then G is a split graph if and only if i
m n
d m(m 1) d
i 1
i
i m 1
i
CN-free graphs,
CAN-free,
and others
An example, from
Struction Revisited,
Alexe, Hammer, Lozin & de Werra (2004)
Choose a pivot x in G. In general, it may grow
Replace x and its neighbors with exponentially large.
some new vertices and edges. But for some graph classes,
Obtain G such that (G ) = (G) 1 the growth can be limited.
Neighborhood Reduction
x y If N[x] N[y], then delete y.
(G {y}) = (G)
i.e., no change in stability number
Perfect
Graphs
Threshold
Graphs
My encounter with threshold graphs
New York Kalamazoo Keszthey
In 1983,
Peter at Rutgers
Marty in Haifa (IBM, Bar-Ilan, U.Haifa)
Peter gave me my first break into the journal editorial world,
first as a Guest Editor for a special issue of DM, then as an
Editorial Board member of the new DAM.
Peter Hammer as the great Enabler
Bringing many, many visitors to RUTCOR.
Welcoming collaborative environment.
Encouraging new talent around the world.
Supporting seasoned talent.
xy E ( rx , ry) > ( tx , ty )
Threshold graphs (Chvtal & Hammer 1977)
xy E ( rx , ry) > ( tx , ty )
Mix functions and their
rank-tolerance graphs
Remark:
Theorem:
Mix functions and their
rank-tolerance graphs
Theorem:
2.
3.
The parameter space
My next talk: Warwick in March 2009:
Thank you
Peter
Thank you
RUTCOR