Results 121 to 130 of about 14,970 (213)

polyhedral methods applied to extremal combinatorics problems

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

The Ramanujan conjecture and its applications. [PDF]

open access: yesPhilos Trans A Math Phys Eng Sci, 2020
Winnie Li WC.
europepmc   +1 more source

Mathematical discoveries from program search with large language models. [PDF]

open access: yesNature
Romera-Paredes B   +11 more
europepmc   +1 more source

Counting Arcs in F q 2. [PDF]

open access: yesDiscrete Comput Geom
Bhowmick K, Roche-Newton O.
europepmc   +1 more source

Long paths and connectivity in 1-independent random graphs. [PDF]

open access: yesRandom Struct Algorithms, 2020
Day AN, Falgas-Ravry V, Hancock R.
europepmc   +1 more source

Home - About - Disclaimer - Privacy