Areas Extremal and probabilistic combinatorics Topic
The linear algebra method
Summary
This topic is a part of extremal and probabilistic combinatorics. It covers dimension arguments that bound the size of set systems and graphs, such as Fisher-type inequalities, intersection theorems modulo primes, rank bounds and exterior algebra.
About this page
| Tag | R44H91QE3W |
|---|---|
| URI | m2://R44H91QE3W |
| Kind | topic |
| Writing | W0 stub |
| MSC | 05D05, 05D99 |
| Part of | Extremal and probabilistic combinatorics |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.