#### Filter Results:

#### Publication Year

1994

1997

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We consider the following two problems. (1) Let t and n be positive integers with n ≥ t ≥ 2. Determine the maximum number of edges of a graph of order n that contains neither K t nor K t,t as a subgraph. (2) Let r, t and n be positive integers with n ≥ rt and t ≥ 2. Determine the maximum number of edges of a graph of order n that does not contain r disjoint… (More)

- ‹
- 1
- ›