Moses - Extremale Graphentheorie

Display language

To modulepage Generate PDF

Module / Version:
#40821 / #1

Validity:
Seit SS 2017

Default display language:
English

Module title:
Extremale Graphentheorie
Extremal Graph Theory

Credits:
6

Responsible person:
Kreutzer, Stephan

Grading:
benotet

Type of exam:
Mündliche Prüfung

Zugehörigkeit

Faculty:
Fakultät IV

Institute:
Institut für Softwaretechnik und Theoretische Informatik

Area of expertise:
34352200 FG Logik und Semantik

Prüfungsausschuss:
No information

Kontakt

Office:
TEL 7-3

Contact person:
No information

E-mail address:
stephan.kreutzer@tu-berlin.de

Website:
No information

Learning Outcomes

Extremal graph theory is the study of what kind of conditions in graphs (such as minimum degree, edge density, size) enforce certain types of properties (such as cliques, colourability, spanning subgraphs etc.). This course provides an introduction to this varied and fascinating branch of graph theory.

Content

The course will cover the following topics: - Basics (Mantel’s theorem, König’s theorem, Tutte’s theorem, Turán’s theorem, Dirac’s theorem) - Erdös-Stone-Simonovits theorem - Probabilistic method - Szemeredi Regularity Lemma and its applications - Triangle Removal Lemma

Module Components

Pflichtgruppe:

All Courses are mandatory.

Course Name	Type	Number	Cycle	Language	SWS	VZ
Extremale Graphentheorie	VL	3435 L 9055	SoSe	No information	2
Extremale Graphentheorie	UE	3435 L 9056	SoSe	No information	2

Workload and Credit Points

Extremale Graphentheorie (VL):

Workload description	Multiplier	Hours	Total
Präsenzzeit	15.0	2.0h	30.0h
Vor-/Nachbereitung	15.0	4.0h	60.0h
			90.0h(~3 LP)

Extremale Graphentheorie (UE):

Workload description	Multiplier	Hours	Total
Präsenzzeit	15.0	2.0h	30.0h
Vor-/Nachbereitung	15.0	4.0h	60.0h
			90.0h(~3 LP)

The Workload of the module sums up to 180.0 Hours. Therefore the module contains 6 Credits.

Description of Teaching and Learning Methods

The course will be delivered in an interactice style through a sequence of lectures combining black board proofs and slides.

Requirements for participation and examination

Desirable prerequisites for participation in the courses:

It is desirable that students taking the course have taken an introduction to graph theory. The course is mostly self-contained, though, but assumes some familiarity with graph theoretical medthods.

Mandatory requirements for the module test application:

This module has no requirements.

Module completion

Grading

graded

Type of exam

Oral exam

Language

English

Duration/Extent

20-40 Minuten

Duration of the Module

The following number of semesters is estimated for taking and completing the module:
1 Semester.

This module may be commenced in the following semesters:
Sommersemester.

Maximum Number of Participants

This module is not limited to a number of students.

Registration Procedures

See http://logic.las.tu-berlin.de

Recommended literature
No recommended literature given

Assigned Degree Programs

Semester:

Zeige auch ausgelaufene Studiengänge und StuPOs

This module is used in the following Degree Programs (new System):

Studiengang / StuPO	StuPOs	Verwendungen	Erste Verwendung	Letzte Verwendung
Computer Engineering (M. Sc.)	1	15	SS 2017	SoSe 2024
Computer Science (Informatik) (M. Sc.)	1	25	SS 2017	SoSe 2024
Elektrotechnik (M. Sc.)	1	15	SS 2017	SoSe 2024

Students of other degrees can participate in this module without capacity testing.

Miscellaneous

No information

Extremale Graphentheorie