Results 91 to 100 of about 13,803 (191)
on certain problems in extremal and additive combinatorics [PDF]
, 2016 This thesis consists of five chapters. The first chapter serves as an introduction, presenting the four problems studied in this thesis, and the results obtained. Each subsequent chapter then treats a separate problem. The second chapter is about the existence of partial isomorphisms (i.e.
openaire +2 more sources
Advancing mathematics by guiding human intuition with AI. [PDF]
Nature, 2021 Davies A +13 more
europepmc +1 more source
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
Treewidth computation and extremal combinatorics
, 2008 Fedor V. Fomin, Yngve Villanger
openalex +2 more sources
Fully Computer-Assisted Proofs in Extremal Combinatorics
, 2023 Olaf Parczyk +3 more
openalex +2 more sources
Universal Limit Theorems in Graph Coloring Problems With Connections to Extremal Combinatorics
, 2013 Bhaswar B. Bhattacharya +2 more
openalex +3 more sources
What cannot be seen correctly in 2D visualizations of single-cell 'omics data? [PDF]
Cell Syst, 2023 Wang S, Sontag ED, Lauffenburger DA.
europepmc +1 more source
The n-queens completion problem. [PDF]
Res Math Sci, 2022 Glock S, Munhá Correia D, Sudakov B.
europepmc +1 more source
Birational contractions of $\overline{\mathrm{M}}_{0,n}$ and combinatorics of extremal assignments
, 2015 Han‐Bom Moon +3 more
openalex +2 more sources