• Nem Talált Eredményt

Combinatorics and graph theory II. 2021 fall, exam topics

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Combinatorics and graph theory II. 2021 fall, exam topics"

Copied!
1
0
0

Teljes szövegt

(1)

Combinatorics and graph theory II. 2021 fall, exam topics

We have proven the framed theorems.

1. Perfect graphs, line graphs, examples for perfect graphs: interval graphs , bipartite graphs , line graph of a bipartite graph , weak perfect graph theorem, strong perfect graph theorem.

2. Partial ordering, poset, chain, antichain, Mirsky's theorem , Dilworth's theorem , comparability graph, connection to perfect graphs,

3. Topological dual, the properties of the dual and the connections between G and G* , algebric dual, weakly isomorphic graphs, Whitney's theorems.

4. 4-color theorem, quasi-planar graph, Ackerman-Tardos theorem, discharging method, If Gis quasi planar, then e≤19n

5. List coloring, list chromatic number, the connection between χ(G)and ch(G), the connection between ch(G) and ∆(G), Galvin's theorem, List coloring conjecture, Thomassens's theorem

6. Ramsey numbers, R(3,3) = 6, Ramsey theorem and its proof by Erd®s and Szekeres , upper bound on R(k, k), probabilisctic method, lower bound on R(k, k),

7. R(c1, c2, . . . ct), upper bounds onR(c1, c2, . . . ct),Rk(c1, c2, . . . ct), Schur's theorem , Van der Wa- erden's theorem, Szemerédi's theorem, Erd®s-Szekeres theorem ,

8. k-partite graphs, complete k-partite graphs, ex(n, H),Ex(n, H), Turán's theorem , Erd®s-Stone theorem, Erd®s-Simonovits theorem, ex(n, H) when H is bipartite

9. Set families, hypergraphs, Erd®s-Ko-Rado theorem , Fischer's inequality , Ray-Chaudhuri-Wilson theorem,

10. Dual hypergaph, De Bruijn-Erd®s theorem , "near pencil" example, Sperner system, Sperner's theorem , LYM inequality

11. Linear recurrence with constant coecients, Fibonacci numbers, Generating functions, Generating function method, characteristic equation method, Closed-form expression of Fn, determination of Fn by the generating function, determination of Fn by the characteristic equation

12. Catalan numbers, several denitions, recurrence for Cn , closed-form expression of Cn , determi- nation of Cn by the generating function, determination of Cn by the mirroring technique

1

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

In this section, we combine our structure theorem with Robertson and Seymour’s structure theorem for graphs with excluded minors [33], which says that for graph H, all graphs

Thus, Dirac's theorem provides a trivial upper bound on the minimum degree of minimally 1 -tough graphs: since this theorem states that every graph on n vertices and with minimum

We slightly transform the problem in such a way that the terminals are represented by vertices in the dual graph (instead of faces)...

(1 point) Therefore G contains a clique of size 3, so G has an independent set of size 3, the corres- ponding three teams have not played with each other. We choose some of its 40

For any graph H ex(n, H) denotes the maximum number of edges of an n vertex simple graph which does not contain H as a subgraph.. If two vertices are contained in different

nc points from the given ones such that the angle between each line which is incident with two choosen points and the x axis is at least 30 degrees or we can choose b √.. nc points

(c) If the graph contains two vertices {u, v} which form a cutset, then we cut the graph among {u, v} , invert one connected component and glue the components among {u, v}: Lets fix

The close connection of Shannon capacity and the notion of graph-different permutations for undirected graphs is explored on a quantitative level in [17] and one could easily formulate