For integers m, n β₯ 2, let f (m, n) be the minimum order of a graph where every vertex belongs to both a clique of cardinality m and an independent set of cardinality n. We show that f (m, n) = ( β m -1 + β n -1) 2 .
Another note on cliques and independent sets
β Scribed by Fred Galvin
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 50 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let G be an undirected connected graph with n nodes. A subset F of nodes of G is a feedback vertex set (fvs) if G -F is a forest and a subset J of nodes of G is a nonseparating independent set (nsis) if no two nodes of J are adjacent and G -J is connected. f(G), z ( G ) denote the cardinalities of a
Mutually orthogonal sets of hypercubes are higher dimensional generalizations of mutually orthogonal sets of Latin squares. For Latin squares, it is well known that the Cayley table of a group of order n is a Latin square, which has no orthogonal mate if n is congruent to 2 modulo 4. We will prove a
## Abstract In this paper, we show that there are at least __cq__ disjoint blocking sets in PG(2,__q__), where __c__βββ1/3. The result also extends to some nonβDesarguesian planes of order __q__. Β© 2005 Wiley Periodicals, Inc. J Combin Designs 14: 149β158, 2006