Revision as of 18:24, 8 March 2008 edit Tangi-tamma (talk \| contribs) 1,091 edits m ←Created page with 'A hypergraph is '''linear''' if any two edges have at most one common vertex. Two edges are '''k-intersecting''' if they share at least k commo...'		Revision as of 18:32, 8 March 2008 edit undo Tangi-tamma (talk \| contribs) 1,091 edits mNo edit summary Next edit →
Line 1: A hypergraph is '''linear''' if any two edges have at most one common vertex. Two edges are '''kr-intersecting''' if they share at least kr common vertices. '''A k-uniform''' hypergraph is hypegraph ~~with~~ with each edge of size k. Note that simple graphs are linear 2-uniform hypergraphs (a simple graph is loopless and contains no multiple edges). The intersection graph of a graph is usually called as [[Line ~~Graph~~graph]]. The characterization of Line graphs was solved by Van Rooij and Wilf and by Beineke.

Line graph of a hypergraph: Difference between revisions