Find link

language:

Find link is a tool written by Edward Betts.

searching for Complete bipartite graph 16 found (158 total)

alternate case: complete bipartite graph

Prüfer sequence (982 words) [view diff] exact match in snippet view article find links to article

can give the number of spanning trees of a complete bipartite graph. If G is the complete bipartite graph with vertices 1 to n1 in one partition and vertices

Graph entropy (914 words) [view diff] exact match in snippet view article find links to article

bipartite graph can have graph entropy greater than that of a complete bipartite graph, which is bounded by 1 {\displaystyle 1} . Thus, by sub-additivity

Extremal graph theory (1,360 words) [view diff] exact match in snippet view article find links to article

G} is a bipartite graph is open; when G {\displaystyle G} is a complete bipartite graph, this is known as the Zarankiewicz problem. The homomorphism density

Independence complex (1,059 words) [view diff] exact match in snippet view article find links to article

G. The (m,n)-chessboard complex is the matching complex on the complete bipartite graph Km,n. It is the abstract simplicial complex of all sets of positions

700 (number) (4,052 words) [view diff] exact match in snippet view article

755 = 5 × 151, number of vertices in a regular drawing of the complete bipartite graph K9,9. 756 = 22 × 33 × 7, sum of six consecutive primes (109 + 113

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

the extremal number of K 2 ( t ) {\displaystyle K_{2}(t)} , the complete bipartite graph with t {\displaystyle t} vertices in each part, is at most ex (

Graph pebbling (1,146 words) [view diff] exact match in snippet view article find links to article

conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications. 11 (6): 1950068

Interval edge coloring (1,659 words) [view diff] exact match in snippet view article find links to article

n-dimensional cube Qn has an interval t-coloring. For any m, n ∈ N, the complete bipartite graph Km,n is interval colorable, and (1) w (Km,n) = m + n − gcd(m, n)

Assignment problem (2,961 words) [view diff] exact match in snippet view article find links to article

technical way to solve this problem is to extend the input graph to a complete bipartite graph, by adding artificial edges with very large weights. These weights

Latin square (3,698 words) [view diff] exact match in snippet view article find links to article

cell containing each symbol. One can consider a Latin square as a complete bipartite graph in which the rows are vertices of one part, the columns are vertices

Strongly regular graph (3,468 words) [view diff] exact match in snippet view article find links to article

n × n square rook's graph, i.e., the line graph of a balanced complete bipartite graph Kn,n, is an srg(n2, 2n − 2, n − 2, 2). The parameters for n = 4

Incidence geometry (3,316 words) [view diff] exact match in snippet view article find links to article

with every line. The incidence graph of a generalized 2-gon is a complete bipartite graph. A generalized n-gon contains no ordinary m-gon for 2 ≤ m < n and

Homomorphism density (2,300 words) [view diff] exact match in snippet view article find links to article

Folding over this line relates C 4 {\displaystyle C_{4}} to the complete bipartite graph K 1 , 2 {\displaystyle K_{1,2}} . Mathematically, this is formalized

Zemor's decoding algorithm (3,237 words) [view diff] exact match in snippet view article find links to article

Note: [If d = n {\displaystyle d=n} and G {\displaystyle G} is the complete bipartite graph, then C {\displaystyle C} is a product code of C o {\displaystyle

Graph removal lemma (5,077 words) [view diff] exact match in snippet view article find links to article

every edge i j {\displaystyle ij} of H {\displaystyle H} by the complete bipartite graph on ( V i , V j ) {\displaystyle (V_{i},V_{j})} . Let ϵ , δ > 0

List of problems in loop theory and quasigroup theory (3,589 words) [view diff] exact match in snippet view article find links to article

Construct a latin square L of order n as follows: Let G = Kn,n be the complete bipartite graph with distinct weights on its n2 edges. Let M1 be the cheapest matching