On the Fractional Intersection Number of a Graph
β Scribed by Edward R. Scheinerman; Ann N. Trenk
- Publisher
- Springer Japan
- Year
- 1999
- Tongue
- English
- Weight
- 101 KB
- Volume
- 15
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and glo
Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.
For an arbitrary graph G we determine the asymptotics of the intersection number (edgeclique covering number) of the categorical (or weak) product of G and the complete graph K,, asymptotically in n. The result follows from a more general theorem on graph capacities which generalizes an earlier resu
Let G be the graph obtained as the edge intersection of two graphs G 1 , G 2 on the same vertex set V . We show that if at , where Ξ±() is the cardinality of the largest stable set. Moreover, for general G 1 and G 2 , we show that Ξ±(G) R(Ξ±(G 1 ) + 1, Ξ±(G 2 ) + 1) -1, where R(k, ) is the Ramsey numbe