Found 4 relevant results in 1.50s where lecturer="Dan Hefetz"
Algebraic techniques and applications to combinatorial problems, e.g. linear and exterior algebraic methods and intersection theorems; the combinatorial Nullstellensatz and graph coloring; Stanley-Reisner rings and face numbers of polytopes and simplicial complexes; algebraic constructions in extremal combinatorics.
k-trees, matchings (Tutte's Theorem, Edmonds' Algorithm), network flows(Goldberg-Tarjan Algorithm), planar graphs (Kuratowski's Theorem,Lipton-Tarjan separators), stable matchings, list coloring(Galvin's Theorem), extremal graph theory (Erdos-Stone Theorem)
This lecture deals with the basic techniques and results in random graph theory. The following topics are introduced: First- and second moment method, concentration inequalities, thresholds, two-round exposure, isolated vertices, clique number, chromatic number, hamiltoncycles, giant component, regular graphs (pairing model).
Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.