Loading...
Please wait, while we are loading the content...
Some Applications of Probability to Graph Theory and Combinatorial Problems
| Content Provider | Semantic Scholar |
|---|---|
| Copyright Year | 2002 |
| Abstract | In the first chapter of my lecture I will discuss applications of probabilistic methods to RAMSAY’S theorem, next I will speak an problems of chromatic graphs and finally I will briefly mention some other problems. @“I will denate a graph of n vertices; a graph is called complete if all its vertices are adjacent. @(“) will denate the complementary graph of @) (i.e. two vertices in @‘j are adjacent if and only if they are not adjacent in @(“))> (k) will denote a complete graph of k vertices. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.math-inst.hu/~p_erdos/1964-26.pdf |
| Alternate Webpage(s) | http://www.renyi.hu/~p_erdos/1964-26.pdf |
| Alternate Webpage(s) | https://users.renyi.hu/~p_erdos/1964-26.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |