Intersection Graphs of Rectangles and Segments

Autor:	R. Ahlswede, I. Karapetyan
Rok vydání:	2006
Předmět:	Combinatorics Discrete mathematics Partition (number theory) Pairwise comparison Disjoint sets Family of sets Coloring problem Intersection graph Clique number Mathematics
Zdroj:	Lecture Notes in Computer Science ISBN: 9783540462446 GTIT-C
DOI:	10.1007/11889342_68
Popis:	Let F be a finite family of sets and G(F) be the intersection graph of F (the vertices of G(F) are the sets of family F and the edges of G(F) correspond to intersecting pairs of sets). The transversal number τ(F) is the minimum number of points meeting all sets of F. The independent (stability) number α(F) is the maximum number of pairwise disjoint sets in F. The clique number ω(F) is the maximum number of pairwise intersecting sets in F. The coloring number q(F) is the minimum number of classes in a partition of F into pairwise disjoint sets.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1595243356359520933a86779e28df1f https://doi.org/10.1007/11889342_68 Zobrazit plný text záznamu