Results 111 to 120 of about 14,970 (213)

Topics in extremal graph theory and probabilistic combinatorics

open access: yes, 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

Fully Computer-Assisted Proofs in Extremal Combinatorics

open access: gold, 2023
Olaf Parczyk   +3 more
openalex   +2 more sources

The n-queens completion problem. [PDF]

open access: yesRes Math Sci, 2022
Glock S, Munhá Correia D, Sudakov B.
europepmc   +1 more source

A scalable assay for chemical preference of small freshwater fish. [PDF]

open access: yesFront Behav Neurosci, 2022
Gallois B   +3 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy