Find link

language:

Find link is a tool written by Edward Betts.

searching for Transversal (combinatorics) 32 found (45 total)

alternate case: transversal (combinatorics)

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

In combinatorics and in experimental design, a Latin square is an n × n array filled with n different symbols, each occurring exactly once in each row

Leon Mirsky (970 words) [view diff] no match in snippet view article find links to article

Russian-British mathematician who worked in number theory, linear algebra, and combinatorics. Mirsky's theorem is named after him. Mirsky was born in Russia on 19

Mutually orthogonal Latin squares (4,827 words) [view diff] no match in snippet view article find links to article

In combinatorics, two Latin squares of the same size (order) are said to be orthogonal if when superimposed the ordered paired entries in the positions

Richard A. Brualdi (592 words) [view diff] no match in snippet view article find links to article

Ryser. Brualdi is an Editor-in-Chief of the Electronic Journal of Combinatorics. He has over 200 publications in several mathematical journals. According

Rainbow matching (2,561 words) [view diff] no match in snippet view article find links to article

a Latin square of order n. A rainbow matching then corresponds to a transversal of the Latin square, meaning a selection of n positions, one in each

Aubrey William Ingleton (762 words) [view diff] no match in snippet view article find links to article

Combin. Theory Ser. B 20 (1976) 41–46. ‘Transversal matroids and related structures’. Higher combinatorics (Proc. NATO Advanced Study Inst., Berlin,

Helly's theorem (958 words) [view diff] no match in snippet view article find links to article

are d+1 collections of convex subsets of Rd. If, for every choice of a transversal – one set from every collection – there is a point in common to all the

Independence Theory in Combinatorics (533 words) [view diff] no match in snippet view article find links to article

Independence Theory in Combinatorics: An Introductory Account with Applications to Graphs and Transversals is an undergraduate-level mathematics textbook

Radon's theorem (2,424 words) [view diff] no match in snippet view article find links to article

Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2nd ed.). Berlin-Heidelberg: Springer-Verlag. ISBN 978-3-540-00362-5

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

are exactly the dual matroids of the transversal matroids. To see that every strict gammoid is dual to a transversal matroid, let γ {\displaystyle \gamma

Rainbow-independent set (2,718 words) [view diff] no match in snippet view article find links to article

in the literature are independent set of representatives, independent transversal, and independent system of representatives. As an example application

Davenport–Schinzel Sequences and Their Geometric Applications (597 words) [view diff] no match in snippet view article find links to article

including Voronoi diagrams and nearest neighbor search, the construction of transversal lines through systems of objects, visibility problems, and robot motion

Ryser's conjecture (876 words) [view diff] no match in snippet view article find links to article

conjecture is a conjecture relating the maximum matching size and the minimum transversal size in hypergraphs. This conjecture first appeared in 1971 in the Ph

Hazel Perfect (805 words) [view diff] no match in snippet view article find links to article

(circa 1927 – 8 July 2015) was a British mathematician specialising in combinatorics. Perfect was known for inventing gammoids,[AMG] for her work with Leon

Shapley–Folkman lemma (10,796 words) [view diff] no match in snippet view article find links to article

The Shapley–Folkman lemma is a result in convex geometry that describes the Minkowski addition of sets in a vector space. It is named after mathematicians

Richard M. Pollack (827 words) [view diff] no match in snippet view article find links to article

York University, where he was Professor Emeritus until his death. In combinatorics, Pollack published several papers with Paul Erdős and János Pach. Pollack

Tverberg's theorem (1,357 words) [view diff] no match in snippet view article find links to article

Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry (2nd ed.), Berlin-Heidelberg: Springer-Verlag, ISBN 978-3-540-00362-5

Carathéodory's theorem (convex hull) (2,159 words) [view diff] no match in snippet view article

"Perron and Frobenius Meet Carathéodory". The Electronic Journal of Combinatorics. 28 (3). arXiv:1901.00540. doi:10.37236/9996. S2CID 119656227. Bárány

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

In combinatorics, a Helly family of order k is a family of sets in which every minimal subfamily with an empty intersection has k or fewer sets in it

Strong coloring (581 words) [view diff] no match in snippet view article find links to article

(1990). Given a graph and a partition of the vertices, an independent transversal is a set U of non-adjacent vertices such that each part contains exactly

Partition matroid (965 words) [view diff] no match in snippet view article find links to article

. The partitions that obey this more restrictive definition are the transversal matroids of the family of disjoint sets given by their blocks. As with

Latin rectangle (834 words) [view diff] no match in snippet view article find links to article

rectangles", Electronic Journal of Combinatorics, 17 (1): Article 1, 46, doi:10.37236/487, MR 2661404 Mirsky, L. (1971), Transversal theory : an account of some

Dual matroid (972 words) [view diff] no match in snippet view article find links to article

gammoids form a self-dual family. The strict gammoids are dual to the transversal matroids. The uniform matroids and partition matroids are self-dual.

NP-intermediate (1,534 words) [view diff] no match in snippet view article find links to article

ISBN 9780201530827. Eiter, Thomas; Gottlob, Georg (2002). "Hypergraph transversal computation and related problems in logic and AI". In Flesca, Sergio;

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

such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory

Perfect graph (7,055 words) [view diff] no match in snippet view article find links to article

non-perfect graphs. In addition, several important minimax theorems in combinatorics, including Dilworth's theorem and Mirsky's theorem on partially ordered

History of geometry (6,299 words) [view diff] no match in snippet view article find links to article

line (called the transversal), and the interior angles between the two lines and the transversal lying on one side of the transversal add up to less than

Matroid oracle (4,287 words) [view diff] no match in snippet view article find links to article

underlying structure from which the matroid was defined for graphic matroids, transversal matroids, gammoids, and linear matroids, and for matroids formed from

Hypergraph (6,817 words) [view diff] no match in snippet view article find links to article

Matching in hypergraphs; Vertex cover in hypergraphs (also known as: transversal); Line graph of a hypergraph; Hypergraph grammar - created by augmenting

Gabriel Pareyon (2,727 words) [view diff] no match in snippet view article find links to article

theoretical contexts, the intersemiotic synecdoche is the analogous operation, transversal to n {\displaystyle n} number of semiotic dimensions. It is, also and

Maximum cut (3,125 words) [view diff] no match in snippet view article find links to article

has applications in VLSI design. Minimum cut Minimum k-cut Odd cycle transversal, equivalent to asking for the largest bipartite induced subgraph Unfriendly

Thābit ibn Qurra (3,235 words) [view diff] no match in snippet view article find links to article

more heavily into the Geometrical relations of numbers establishing his Transversal (geometry) theorem. Thābit described a generalized proof of the Pythagorean