English Ruzsa–Szemerédi problem Cited by user Citation bot on 30 Apr 2024 In combinatorial mathematics and extremal graph theory, the Ruzsa–Szemerédi problem or (6,3)-problem asks for the maximum number of edges in a graph in which every edge…
English Bounded expansion Cited by user Citation bot on 06 Dec 2023 In graph theory, a family of graphs is said to have bounded expansion if all of its shallow minors are sparse graphs.
English Offset Filtration Cited by user Khmccabe on 25 Feb 2023 The offset filtration (also called the "union-of-balls" or "union-of-disks" filtration) is a growing sequence of metric balls used to detect the size and scale of…
Ukrainian Задача Ружі — Семереді Cited by user Lxlalexlxl on 03 Nov 2022 Задача Ружі — Семереді або (6,3)-проблема запитує про найбільшу кількість ребер у графі, в якому будь-яке ребро належить єдиному трикутнику.