Results 101 to 110 of about 887,124 (211)

Extremal combinatorics in generalized Kneser graphs

open access: yes, 2003
This thesis focuses on the interplay of extremal combinatorics and finite geometry. Combinatorics is concerned with discrete (and usually finite) objects. Extremal combinatorics studies how large or how small a collection of finite objects can be under certain restrictions. Those objects can be sets, graphs, vectors, etc.
openaire   +2 more sources

Locally common graphs. [PDF]

open access: yesJ Graph Theory, 2023
Csóka E, Hubai T, Lovász L.
europepmc   +1 more source

on certain problems in extremal and additive combinatorics [PDF]

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

open access: yesNature, 2021
Davies A   +13 more
europepmc   +1 more source

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

Home - About - Disclaimer - Privacy