๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the intersection rank of a graph

โœ Scribed by James A. Wiseman

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
748 KB
Volume
104
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.

๐Ÿ“œ SIMILAR VOLUMES

The intersection graph of random sets
The intersection graph of random sets
โœ Hiroshi Maehara ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 369 KB

Maehara, H., The intersection graph of random sets, Discrete Mathematics 87 (1991) 97-104. Let X,, i=l,..., n, be n = n(N) independent random subsets of {1,2,. . , N}, each selected at random out of the 2N subsets. We present some asymptotic (N-tm) properties of {Xi}, e.g. if r~/2~'~--+ m then {Xi}

On the intersection of edges of a geomet
On the intersection of edges of a geometric graph by straight lines
โœ N. Alon; M.A. Perles ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0

On set intersection representations of g
On set intersection representations of graphs
โœ Stasys Jukna ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 193 KB ๐Ÿ‘ 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~โŠ†{1, โ€ฆ, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only

Rank and chromatic number of a graph
Rank and chromatic number of a graph
โœ Kotlov, Andrei? ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 105 KB ๐Ÿ‘ 2 views

It was proved (A. Kotlov and L. Lovรกsz, The rank and size of graphs, J. Graph Theory 23 (1996), 185-189) that the number of vertices in a twin-free graph is O(( โˆš 2) r ) where r is the rank of the adjacency matrix. This bound was shown to be tight. We show that the chromatic number of a graph is o(โˆ†

Chromatic Number and the 2-Rank of a Gra
Chromatic Number and the 2-Rank of a Graph
โœ C.D. Godsil; Gordon F. Royle ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 98 KB

We show that if the adjacency matrix of a graph X has 2-rank 2r, then the chromatic number of X is at most 2 r +1, and that this bound is tight. 2001