Topics in Advanced Algorithms -
CSCI-761, Spring 2021
bldg. 70B, room 3657,
(585) 475-5193, firstname.lastname@example.org,
office hours: TR 6:30pm-7:30pm via
zoom, or email email@example.com anytime
Tuesday/Thursday, 5:00pm-6:15pm, room 70-1610
General Course Documents
College course document, and
common RIT policies and calendar.
This course will explore the possibilities and limitations of
effective computations in combinatorics.
The first half of the course will cover classical algorithms
in combinatorial computing, together with the problems of
generation, enumeration and manipulation of various types
of combinatorial objects (graphs and finite set systems).
The second part will concentrate on computational techniques
for the search of different combinatorial configurations:
Ramsey numbers, t-designs, Turan coverings, Folkman colorings
and others. A number of topics suitable for further independent
study, project or thesis development will be discussed.
Students will write a term paper, either
theoretical based on literature or reporting student's own
implementation or experiments with a chosen combinatorial problem.
Depending on the size of the group, some or all students will
give a presentation to the class.
Combinatorial Algorithms. Generation, Enumeration, and Search,
by Donald L. Kreher and Douglas R. Stinson, CRC Press, 1999.
- Handbook of Combinatorics by
R. Graham, M. Grotschel and L. Lovasz,
MIT Press, 1995 (complementary reference monograph).
- Introductory Combinatorics by
Kenneth Bogart, third edition,
HBJ Publ., 2000 (complementary combinatorial background).
CSCI-665 or ((CSCI-261 or CSCI-264) and permission of the
Main Online Resources
Done So Far (with pointers to item numbers on the "To Do" list below, #n):
Course logistics, my homepage, seating chart. General overview.
Assignment 1 (on homeworks page),
#1 (on To Do list).
#3, start #4.
More on #4, start #5.
Parts of #7. Permutation groups, cycle notation, generators.
#6. Lecture 5 by Jacob Fox. We will be back to #7.
Resolving doubts about assignment #3.
Solutions to #1 and #2.
#6. Lecture 6 by Jacob Fox.
#7. Permuation groups.
#7. Caley graphs. Paley graphs. J4-free graphs.
Cliques and chromatic numbers are NP-hard. #9.
#10. Computing cliques.
#10. Greedy coloring and computing cliques.
Midterm exam, online.
Review of midterm exam, in class.
#12. What is in the Assignment #6.
#12 and #13.
Two theorems: on
A very special bicritical
#13 and #14.
Graph G127, reducing Ramsey triangle arrowing to 3SAT.
Reconstruction Conjecture, part I.
encoding Ramsey/Folkman problems, via zoom (OH link),
resolving the Keller's Conjecture, via zoom (OH link),
Reconstruction Conjecture, part II.
4/22. No class, recharge day.
Reconstruction Conjecture, complexity.
#16. Diagonal Conjecture.
#17. Shannon capacity.
#17. Shannon capacity, part II. #18. Collatz conjecture.
5/13. Final exam posted, due 5/15 23:59.
(with links to supporting materials):
at ANU in ACT of AUS.
a very useful way to write graphs to files and pipes. You do not need to
know all its details, but you need to know how to make your
programs read and write graphs encoded in g6.
Wolfram MathWorld page on graph isomorphism problem,
further links to canonical labeling, automorphisms and such.
Wolfram is also famous because of
A New Kind of Science.
Overview of Computations in Ramsey Theory.
For homework #2, look at the tables I, II, III and IV on pages 45-47 of a
very old paper posted at position #97 of the
(or get paper's
or just the tables tabs88.pdf).
There are three nonisomorphic (3,4;8)-Ramsey critical graphs
for K3 versus K4, check out their
linked to cycle representation of their automorphism group generators.
Two papers with
Jan Goedgebeur, at positions
#35 and #31 of the
present recent developments of what is known about (3,k;n,e)-Ramsey graphs
(reading these two papers is not required, but I encourage you to do so).
Overview slides of
computational Ramsey theory is well complemented by
lecture 5 and
lecture 6 at MIT by
Basics of groups: the
symmetric group, alternating group, sign, cycles and such.
Cayley graphs of groups are explaining things even more,
Cayley graphs of the group of automorphisms of pentagon for
three different pairs of generators.
Refreshing what you know about
of binomial coefficients and
(use also Wolfram pages, not only wiki)
will help in better understanding
of the upper bound on R(s,t). And/or, if you really want to know more
about CS side of Newton binomial coefficients dive into the book
by Petkovsek, Wilf and
Doron Zeilberger. A=B is free.
problem of colored permutations.
Computing Cliques by Donald Kreher,
slides and chapter 4.6.3.
Ramsey page at RIT-CS.
Ramsey arrowing, Folkman graphs and numbers:
An old 1-page-long article
by Ron Graham on the first cool Folkman number Fe(3,3;6)=8.
Slides 21+ of
Computations in Ramsey Theory.
About 40 years later, a paper on the
most wanted Folkman graph, with associated
Two theorems: on
The very special bicritical
graph, for Fv(3,3;4)=14.
Conference presentation on
Time for the G127 arrowing problem to be settled!
Several technical papers on Folkman problems co-authored by the instructor
are posted at
Christopher Wood wrote a comprehensive
survey of the area.
A more recent
PhD thesis by Aleksandar Bikov
covers extensively all computational af the area.
Reconstruction Conjecture, presentation based mainly on the MS work by David Rivshin,
slides B, and
Shannon capacity of noisy channels modelled by graphs, and its relation
to Ramsey numbers,
and a theorem.
Collatz 3n+1 conjecture.
On special Folkman graphs, the existence and search,
Other Online Resources