Results 111 to 120 of about 14,970 (213)
Topics in extremal graph theory and probabilistic combinatorics
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
Fully Computer-Assisted Proofs in Extremal Combinatorics
Olaf Parczyk+3 more
openalex +2 more sources
Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics
Bhaswar B. Bhattacharya+2 more
openalex +3 more sources
The n-queens completion problem. [PDF]
Glock S, Munhá Correia D, Sudakov B.
europepmc +1 more source
Treewidth computation and extremal combinatorics
Fedor V. Fomin, Yngve Villanger
openalex +2 more sources
Measurement of market (industry) concentration based on value validity. [PDF]
Kvålseth TO.
europepmc +1 more source
Birational contractions of $\overline{\mathrm{M}}_{0,n}$ and combinatorics of extremal assignments
Han‐Bom Moon+3 more
openalex +2 more sources
A scalable assay for chemical preference of small freshwater fish. [PDF]
Gallois B+3 more
europepmc +1 more source