Find link

language:

Find link is a tool written by Edward Betts.

searching for Intersection graph 11 found (75 total)

List of circle topics (2,411 words) [view diff] exact match in snippet view article find links to article

that lie inside a bigger circle and tangent to it Circle graph – Intersection graph of a chord diagram Circle map – Phenomenon in mathsPages displaying

Matching in hypergraphs (2,606 words) [view diff] exact match in snippet view article find links to article

its minimum edge coloring number. H has the Helly property, and the intersection graph of H (the simple graph in which the vertices are E and two elements

Hypertree (622 words) [view diff] case mismatch in snippet view article find links to article

322390, MR 0709831. McKee, T.A.; McMorris, F.R. (1999), Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications,

Set packing (1,514 words) [view diff] exact match in snippet view article find links to article

set contains at most k elements (the k-set packing problem), the intersection graph is (k+1)-claw-free. This is because, if a set intersects some k+1

Helly family (1,274 words) [view diff] exact match in snippet view article find links to article

following are equivalent:: 470–471 H has the Helly property, and the intersection graph of H (the simple graph in which the vertices are E and two elements

Split (graph theory) (1,328 words) [view diff] exact match in snippet view article

split quotient is either complete or bipartite. A circle graph is the intersection graph of a family of chords of a circle. A given graph is a circle graph

Dually chordal graph (873 words) [view diff] case mismatch in snippet view article find links to article

0.co;2-m. McKee, Terry A.; McMorris, FR. (1999), Topics in Intersection Graph Theory, SIAM Monographs on Discrete Mathematics and Applications.

List of conjectures (1,461 words) [view diff] exact match in snippet view article find links to article

counterexample announced 2019 Hirsch conjecture (disproved in 2010) Intersection graph conjecture Kelvin's conjecture Kouchnirenko's conjecture Mertens conjecture

Virgil D. Gligor (2,117 words) [view diff] exact match in snippet view article find links to article

co-designed with his student L. Eschenauer, gave rise to a uniform random intersection graph, or simply a random key graph. Its k-connectivity and k-robustness

Mesh generation (5,909 words) [view diff] exact match in snippet view article find links to article

cubical mesh by generating an arrangement of surfaces and dualizing the intersection graph; see spatial twist continuum. Sometimes both the primal mesh and its

List of unsolved problems in mathematics (20,120 words) [view diff] exact match in snippet view article find links to article

Chalopin, Jérémie; Gonçalves, Daniel (2009). "Every planar graph is the intersection graph of segments in the plane: extended abstract". In Mitzenmacher, Michael