Find link

language:

Find link is a tool written by Edward Betts.

searching for Large set (combinatorics) 21 found (25 total)

alternate case: large set (combinatorics)

Szemerédi–Trotter theorem (2,432 words) [view diff] no match in snippet view article find links to article

incidence geometry and the Erdős-Szemerédi sum-product problem in additive combinatorics. We may discard the lines which contain two or fewer of the points,

József Solymosi (711 words) [view diff] no match in snippet view article find links to article

University of British Columbia. His main research interests are arithmetic combinatorics, discrete geometry, graph theory, and combinatorial number theory. Solymosi

Sunflower (mathematics) (2,888 words) [view diff] no match in snippet view article

in mathematics In the mathematical fields of set theory and extremal combinatorics, a sunflower or Δ {\displaystyle \Delta } -system is a collection of

Erdős–Szemerédi theorem (2,731 words) [view diff] no match in snippet view article find links to article

In arithmetic combinatorics, the Erdős–Szemerédi theorem states that for every finite set A of integers, at least one of the sets A + A and A · A (the

Pigeonhole principle (4,190 words) [view diff] no match in snippet view article find links to article

arXiv:1412.1333 [quant-ph]. Brualdi, Richard A. (2010), Introductory Combinatorics (5th ed.), Pentice Hall, ISBN 978-0-13-602040-0 Fletcher, Peter; Patty

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

dependent random choice is a probabilistic technique that shows how to find a large set of vertices in a dense graph such that every small subset of vertices

List of exceptional set concepts (152 words) [view diff] no match in snippet view article find links to article

conull set Partition regular Piecewise syndetic set Schnirelmann density Small set (combinatorics) Stationary set Syndetic set Thick set Thin set (Serre)

Counting lemma (2,423 words) [view diff] no match in snippet view article find links to article

The counting lemmas this article discusses are statements in combinatorics and graph theory. The first one extracts information from ϵ {\displaystyle

Toroidal graph (707 words) [view diff] no match in snippet view article find links to article

Woodcock, Jennifer (2018), "A large set of torus obstructions and how they were discovered", Electronic Journal of Combinatorics, 25 (1): P1.16, doi:10.37236/3797

Debra Boutin (745 words) [view diff] no match in snippet view article find links to article

distinguishing costs and determining numbers of graphs. These papers appear in combinatorics, graph theory, algebra and geometry journals. She has been invited and

Robertson–Seymour theorem (2,900 words) [view diff] no match in snippet view article find links to article

Woodcock, Jennifer (2018), "A Large Set of Torus Obstructions and How They Were Discovered", The Electronic Journal of Combinatorics, 25 (1): P1.16, doi:10.37236/3797

Knight's tour (2,318 words) [view diff] no match in snippet view article find links to article

294—counting with binary decision diagrams". Electronic Journal of Combinatorics. 3 (1). Research Paper 5. doi:10.37236/1229. MR 1368332. See attached

International Mathematical Olympiad selection process (6,937 words) [view diff] no match in snippet view article find links to article

four problem usually covering geometry, number theory, algebra, and combinatorics (elementary level) and last four hours each. After successfully completing

Theoretical computer science (4,803 words) [view diff] no match in snippet view article find links to article

in Theoretical Computer Science Journal of Automata, Languages and Combinatorics Acta Informatica Fundamenta Informaticae ACM Transactions on Computation

Happy ending problem (1,878 words) [view diff] no match in snippet view article find links to article

"A combinatorial problem on convex regions", Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Congressus Numerantium, vol. 1, Baton Rouge

Square-difference-free set (1,986 words) [view diff] no match in snippet view article find links to article

related to the Furstenberg-Sárközy theorem", Electronic Journal of Combinatorics, 22 (1), Paper P1.32, 6pp, doi:10.37236/4656, MR 3315474. Sloane, N

Lu Jiaxi (mathematician) (3,113 words) [view diff] no match in snippet view article

talk, he received a unanimous accolade. In August, he took part in a combinatorics workshop in Hefei as a helper and gave a talk there. Although he had

Blow-up lemma (2,789 words) [view diff] no match in snippet view article find links to article

(1998-03-01). "Proof of the Seymour conjecture for large graphs". Annals of Combinatorics. 2 (1): 43–60. doi:10.1007/BF01626028. ISSN 0219-3094. S2CID 9802487

Cycle basis (3,322 words) [view diff] no match in snippet view article find links to article

of a graph", Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981), Congressus

String theory (15,298 words) [view diff] no match in snippet view article find links to article

hope of using the theory to predict anything. If one picks among this large set just those states whose properties agree with present experimental observations

History of mathematical notation (11,251 words) [view diff] no match in snippet view article find links to article

practical uses as it is, but it also was the start of what would be a large set of symbols to be used in logic. Most of these symbols can be found in