Topics in extremal graph theory and probabilistic combinatorics
, 2018 This thesis considers a variety of problems in Extremal Graph Theory and Probabilistic Combinatorics. Most of these problems are structural in nature, but some concern random reconstruction and parking problems. A matching in a bipartite graph G = (U, V, E) is a subset of the edges where no two edges meet, and each vertex from U is in an edge.
openaire +1 more source
Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics
, 2013 Bhaswar B. Bhattacharya +2 more
openalex +3 more sources
Treewidth computation and extremal combinatorics
, 2008 Fedor V. Fomin, Yngve Villanger
openalex +2 more sources
Measurement of market (industry) concentration based on value validity. [PDF]
PLoS One, 2022 Kvålseth TO.
europepmc +1 more source
A scalable assay for chemical preference of small freshwater fish. [PDF]
Front Behav Neurosci, 2022 Gallois B +3 more
europepmc +1 more source
Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models. [PDF]
J Math Biol, 2020 Chauve C, Ponty Y, Wallner M.
europepmc +1 more source
The Soifer (formerly Colorado) Mathematical Olympiad, why it was founded, bridge between its problems and mathematics, and lives of its winners: an essay. [PDF]
ZDM, 2022 Soifer A.
europepmc +1 more source
The Ramanujan conjecture and its applications. [PDF]
Philos Trans A Math Phys Eng Sci, 2020 Winnie Li WC.
europepmc +1 more source
polyhedral methods applied to extremal combinatorics problems
, 2014 Wir untersuchen Polytope, die zwei bekannte Probleme beschreiben: das Hypergraphen-Problem von Turán und die Vermutung von Frankl. Das Hypergraphen-Problem von Turán bestimmt die maximale Anzahl der r-Kanten in einem r-Hypergraph mit n Knoten, so dass der daraus entstandene r-Teil-Hypergraph keine Clique der Größe a enthält.
openaire +2 more sources