Find link

language:

Find link is a tool written by Edward Betts.

searching for Covering number 23 found (30 total)

Vertex cover (2,556 words) [view diff] no match in snippet view article find links to article

In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph.

Edge cover (627 words) [view diff] exact match in snippet view article find links to article

edge covering is an edge covering of smallest possible size. The edge covering number ρ(G) is the size of a minimum edge covering. The following figure shows

Complete bipartite graph (960 words) [view diff] exact match in snippet view article find links to article

The complete bipartite graph Km,n has a vertex covering number of min{m, n} and an edge covering number of max{m, n}. The complete bipartite graph Km,n

Eternal dominating set (1,820 words) [view diff] exact match in snippet view article find links to article

graph G such that γ(G) equals γ∞(G) and γ(G) is less than the clique covering number of G? More unsolved problems in mathematics In graph theory, an eternal

Journal de Théorie des Nombres de Bordeaux (164 words) [view diff] exact match in snippet view article find links to article

Bordeaux is a triannual peer-reviewed open-access scientific journal covering number theory and related topics. It was established in 1989 and is published

Research in Number Theory (158 words) [view diff] exact match in snippet view article find links to article

Research in Number Theory is a peer-reviewed mathematics journal covering number theory and arithmetic geometry. The editors-in-chief are Jennifer Balakrishnan

Kissing number (2,204 words) [view diff] exact match in snippet view article find links to article

Zong, Chuanming (2008). "The kissing number, blocking number and covering number of a convex body". In Goodman, Jacob E.; Pach, J├ínos; Pollack, Richard

Matching (graph theory) (2,938 words) [view diff] exact match in snippet view article

without isolated vertices, the sum of the matching number and the edge covering number equals the number of vertices. If there is a perfect matching, then

Archivaria (637 words) [view diff] exact match in snippet view article find links to article

Canadian university. Indexes to articles appeared in issue number 12 covering number 1 (1976) to 10 (1980) and issue number 22 covering numbers 11 (1980)

Cardinal function (2,103 words) [view diff] exact match in snippet view article find links to article

{A}}|:{\mathcal {A}}\subseteq I\wedge \bigcup {\mathcal {A}}=X\}.} The "covering number" of I is the smallest number of sets from I whose union is all of X

Falconar Avia (444 words) [view diff] case mismatch in snippet view article find links to article

Headquarters Edmonton, Alberta , Canada Products Aircraft parts, kits and plans, Aircraft fabric covering Number of employees two Website falconaravia.com

Ahlfors theory (1,195 words) [view diff] exact match in snippet view article find links to article

boundary. Let L be the length of this relative boundary. The average covering number is defined by the formula S = A ( X ) A ( Y ) . {\displaystyle S={\frac

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

G} and γ ( G ) {\displaystyle \gamma (G)} is less than the clique covering number of G {\displaystyle G} ? Graham's pebbling conjecture on the pebbling

Icosahedral symmetry (2,425 words) [view diff] no match in snippet view article find links to article

vertices and the centers of each edge lie over 0 and 1; the degree of the covering (number of sheets) equals 5. This arose from his efforts to give a geometric

Cichoń's diagram (1,154 words) [view diff] exact match in snippet view article find links to article

{A}}|:{\mathcal {A}}\subseteq I\wedge \bigcup {\mathcal {A}}=X{\big \}}.} The "covering number" of I is the smallest number of sets from I whose union is all of X

Nevanlinna theory (2,609 words) [view diff] exact match in snippet view article find links to article

covering of the Riemann sphere by the disc |z| ≤ t. Then this average covering number is integrated with respect to t with weight 1/t. The role of the characteristic

Bipartite dimension (1,737 words) [view diff] case mismatch in snippet view article find links to article

Guo, Krystal; Huynh, Tony; Macchia, Marco (2019), "The Biclique Covering Number of Grids", The Electronic Journal of Combinatorics, 26 (4), arXiv:1811

Dominance order (1,115 words) [view diff] exact match in snippet view article find links to article

invariants of the lattice Ln, such as the minimal height and the maximal covering number, and classified the intervals of small length. While Ln is not distributive

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

hypergraph in which there is some relation between the matching and the covering number. Erdős–Ko–Rado theorem on pairwise non-disjoint edges in hypergraphs

Reinhold Hoppe (762 words) [view diff] exact match in snippet view article find links to article

Zong, Chuanming (2008), "The kissing number, blocking number and covering number of a convex body", in Goodman, Jacob E.; Pach, János; Pollack, Richard

Communication complexity (6,853 words) [view diff] exact match in snippet view article find links to article

communication complexity is the binary logarithm of the rectangle covering number of the matrix: the minimum number of combinatorial 1-rectangles required

Glossary of set theory (11,628 words) [view diff] exact match in snippet view article find links to article

elements can be listed in a sequence without end. cov(I) covering number The covering number cov(I) of an ideal I of subsets of X is the smallest number

Corona product (282 words) [view diff] exact match in snippet view article find links to article

Subha, M.; Kumari, S. Santha (April 2023). "Monophonic graphoidal covering number of corona product graphs". Proyecciones - Journal of Mathematics. 42