__ Lectures:__
12:45pm—2:00pm
Mon,
Wed.
Blocker 121.

__ Instructor:__
Chun-Hung
Liu, Blocker 631B, chliu (at) math (dot) tamu (dot) edu.

__ Office
hours:__
2:00pm—3:00pm,
Mon, or by appointments.

__ Textbook:__
No required
textbook.

The following books are good references:

“Introduction to Graph Theory”, 2nd edition, by Douglas B. West. Prentice Hall, ISBN 0-13-014400-2. (The ISBN might have changed to 9780131437371.)

“Graph Theory”, 5

^{th}edition, by Reinhard Diestel. Springer-Verlag, Heidelberg, ISBN 978-3-662-53621-6.“The Probabilistic Method”, 4

^{th}edition, by Noga Alon and Joel H. Spencer. Wiley, ISBN 978-1119061953.

__ Course
Description:__ Graphs
are used to model problems in different areas in mathematics and
engineering, such as in metric geometry, network theory, and VLSI
design. This course will address algorithmic problems about graphs,
such as how to efficiently determine whether the input graph has
certain properties or efficiently find certain substructures in the
input graph. We will cover classical results and recent developments.

__ Prerequisites:__
MATH 613
or
equivalent.

Syllabus
(**This
document contains important information about this course. Please
read it carefully.**)
(This
document might be revised during the first week of the semester.)

Tentative schedule (This schedule might be updated frequently during the semester without notification.)

**Homework assignments:**

Questions for homework assignments will be announced at Gradescope.

**Lecture
notes:**