Generalized Split Graphs and Ramsey Numb
β
AndrΓ‘s GyΓ‘rfΓ‘s
π
Article
π
1998
π
Elsevier Science
π
English
β 283 KB
A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown th