Find link

language:

Find link is a tool written by Edward Betts.

searching for T-vertices 10 found (12 total)

alternate case: t-vertices

Boxicity (1,497 words) [view diff] no match in snippet view article find links to article

on t vertices as a minor, then box(G)=O(t2log⁡t){\displaystyle box(G)=O(t^{2}\log t)} while there are graphs with no complete graph on t vertices as a

Erdős–Stone theorem (1,362 words) [view diff] no match in snippet view article find links to article

theorem extends this result to H = Kr(t), the complete r-partite graph with t vertices in each class, which is the graph obtained by taking Kr and replacing

Zarankiewicz problem (4,858 words) [view diff] no match in snippet view article find links to article

s{\displaystyle s} vertices and V{\displaystyle V} has t{\displaystyle t} vertices is denoted Ks,t{\displaystyle K_{s,t}}. If G=(U∪V,E){\displaystyle G=(U\cup

Triangle-free graph (2,487 words) [view diff] no match in snippet view article find links to article

complete graph on Ω(t2log⁡t){\displaystyle \Omega ({\tfrac {t^{2}}{\log t}})} vertices are colored red and blue, then either the red graph contains a triangle

Dependent random choice (1,678 words) [view diff] no match in snippet view article find links to article

at random, the procedure randomly chooses a list of t{\displaystyle t} vertices first and then chooses common neighbors as the set of vertices. The hope

Consensus clustering (2,930 words) [view diff] no match in snippet view article find links to article

the edges of the graph to be partitioned. In sHBGF, the graph has n + t vertices, where t is the total number of underlying clusters. Bayesian consensus

Karger's algorithm (2,216 words) [view diff] no match in snippet view article find links to article

perform the contraction procedure until the graph reaches t{\displaystyle t} vertices. procedure contract(G=(V,E){\displaystyle G=(V,E)}, t{\displaystyle t}):

Random surfing model (941 words) [view diff] no match in snippet view article find links to article

\ldots } such that a graph Gt{\displaystyle G_{t}} has t{\displaystyle t} vertices and t{\displaystyle t} edges. The process of defining graphs is parameterized

Automatic summarization (6,825 words) [view diff] no match in snippet view article find links to article

user-specified fraction of the total number of vertices in the graph. Then the top T vertices/unigrams are selected based on their stationary probabilities. A post-

Ramsey's theorem (7,774 words) [view diff] no match in snippet view article find links to article

are both even. Let t = p + q − 1 and consider a two-coloured graph of t vertices. If di is degree of i-th vertex in the blue subgraph, then, according