Search results

...ealized as an intersection graph of disks in the plane. This is an example of a graph with sphericity 2, also known as a [[unit disk graph]].]] ...>{{Cite journal |last=Maehara |first=Hiroshi |date=1984-01-01 |title=Space graphs and sphericity |url=https://dx.doi.org/10.1016/0166-218X%2884%2990113-6 |jo ...

...family of graphs has few cliques if the graphs do not have a large number of large [[Cluster (statistics)|clusters.]] ...ible maximal cliques has computational ramifications for [[algorithm]]s on graphs or networks. ...

...d [[Geometric graph theory|geometrically]], as the [[intersection graph]]s of line segments whose endpoints lie on two [[parallel (geometry)|parallel]] l ...math>\rho = (\sigma_1,\sigma_2,...,\sigma_n)</math> is any [[permutation]] of the numbers from <math>1</math> to <math>n</math>, then one may define a pe ...

{{Short description|Intersection graph for a set of arcs on a circle}} ...ach arc in the set, and an [[edge (graph theory)|edge]] between every pair of vertices corresponding to arcs that intersect. ...

{{Short description|Graphs whose distances obey Ptolemy's inequality}} [[File:Block graph.svg|thumb|A [[block graph]], a special case of a Ptolemaic graph]] ...

...ted <math>\chi(G)</math>. An overview of the area can be found in a survey of Alex Scott and [[Paul Seymour (mathematician)|Paul Seymour]].{{r|survey}} It is not true that the family of all graphs is <math>\chi</math>-bounded. ...

{{Short description|Intersection graph of trapezoids between parallel lines}} ...y an edge if and only if the corresponding trapezoids intersect. Trapezoid graphs were introduced by [[Ido Dagan|Dagan]], [[Martin Charles Golumbic|Golumbic] ...

{{Short description|Refinement of perfect matching theorems}} ...ein Ore]].<ref>{{Cite journal|last=Ore|first=Oystein|date=1955-12-01|title=Graphs and matching theorems|url=https://projecteuclid.org/euclid.dmj/1077466548|j ...

[[File:Groetsch-3-coloring.svg|thumb|A 3-coloring of a triangle-free planar graph]] ...ut according to Grötzsch's theorem only three colors are needed for planar graphs that do not contain three mutually adjacent vertices. ...

...ure about [[intersection number]]s of stable classes on the [[moduli space of curves]], introduced by [[Edward Witten]] in the paper {{harvs|txt|last=Wit ...formed from intersection numbers should satisfy the differential equations of the KdV hierarchy. ...

...bbs was born on June 19, 1940, in Washington, D.C. He was the eldest child of his family, having two younger brothers. His father was an engineer and lat ...ely two years, and then from 1965 to 1968 worked for the [[National Bureau of Standards]]. ...

...ction of two [[finitely generated group|finitely generated]] [[subgroup]]s of a [[free group]]. The conjecture was posed by [[Hanna Neumann]] in 1957.<re | title=On the intersection of finitely generated free groups. Addendum ...

{{Short description|Intersection graph of unit intervals on the real number line}} ...ce graph, formed from a set of points on the real line by connecting pairs of points whose distance is at most one]] ...

{{bots|deny=OAbot}}<!-- To prevent re-addition of bogus pmc --> {{Short description|Partition of graph into sequence of paths}} ...

...the case of locally finite graphs) as [[end (topology)|topological end]]s of [[topological space]]s associated with the graph. ...one, two, or infinitely many ends, and the [[Stallings theorem about ends of groups]] provides a decomposition for groups with more than one end. ...

| title = Intersections of translates of convex bodies | publisher = Department of Mathematical Sciences, Chalmers Institute of Technology ...

...that of a [[hyperfinite equivalence relation]], but is of interest in and of itself. ...ath>F</math>", then <math>E</math> and <math>F</math> have a similar level of complexity. When one talks about [[Borel equivalence relation]]s and requir ...

{{Short description|Branch of topology}} ..., is the study of algebraic structures on the [[homology theory|homology]] of [[free loop space]]s. The field was started by {{harvs|txt|first1=Moira|las ...

...'') is a [[free group]] counterpart of the notion of the [[curve complex]] of a finite type surface. ...ctor complex plays a significant role in the study of large-scale geometry of [[Out(Fn)|<math>\operatorname{Out}(F_n)</math>]]. ...

...intersection representation, each vertex can be represented by the subset of these cliques that it belongs to.]] ...e (graph theory)|cliques]] needed to [[Edge cover|cover]] all of the edges of <math>G</math>.{{r|gy06|r85}} ...