LOGISTICS
REGULATIONS & POLICIES
Course Lecturer
Welcome to the course! Do let me know if you are in need of any assistance
CONTACT DETAILS
Office: 58.03.05
Email: horev dot elad at gmail dot com
Admission hours: By appointment
​
Material for the finals
The material for the final exam(s) consists of everything found in the:
-
Course booklets
-
Course slides
-
Course videos
-
Course handouts (e.g., solved exercises etc.)
-
Every material for which there is a link to in the course website.
-
All book references made throughout the course within the course lectures, course booklet, videos, slides, homework etc.
​
​
Course Videos
CLARIFICATIONS
Some of the course material is covered in various videos linked in the main course page. The videos do not cover all the material considered in the course.
As the videos were recorded during previous course instances, you are to ignore any logistical regulations seen in these videos (in the odd and obscure case that such a thing actually took place). Moreover, if any video deviates from what is written here, then you are to ignore the video and adhere to the list appearing here.
​
Rule: you are only to consider the mathematical content of the videos and ignore all the rest.
EXAM STRUCTURE
Duration: 4 hours
# of questions: 4
Language of the exam: English
​
Front pages of the final exams: English | Hebrew
Both versions will accompany the exams.
​
You may write your answers in either English or Hebrew
​
Allowed material in the finals:
A physical dictionary translating the English language to any other language you wish. Electorinic dictionaries of any kind are forbidden.
​
3 handwritten A4 sheets (i.e. a total of 6 A4 pages)
​
ANSWER SHEETS:
The exam is accompanied with answer sheets only with which one is to supply one's answers to the exam.
​​
Additional information:
The course syllbus contains further information on the
final exams. This information is binding and you are hereby expected to be familiar with it in full.
Zoom Link for Sessions
All sessions are to be accessed through this link
READING LIST
READ & EXPAND YOUR KNOWLEDGE
You are hereby envouraged to read and expand your knowledge. Below is a list of reading materials to get you started.
Local resilience of graphs
Suppose that a graph G satisfies some property P. What is the least number of edges that one has to remove from G in order to generate a graph that does not satisfy P? Put another way, how resilient is P?
​
Sudakov and Vu (2007) initiated the systematic study of the (local) resilience of graph properties.
Van H. Vu
Benny Sudakov
The Sudakov-Vu paper can be found here.
​
FINAL EXAMS
EXAMS FROM PREVIOUS COURSE INSTANCES
Below you may find final exams from last year. The syllabus contains a fairly long yet precise account asserting that absolutely nothing can be deduced from these exams regarding the exams of the current course instance. These exams are provided to you as a service whose sole aim is to relieve tension amongst the student body whilst preparing for the exams.