Results 91 to 100 of about 934 (196)

Some Results in Extremal Combinatorics [PDF]

open access: yes, 2013
Extremal Combinatorics is one of the central and heavily contributed areas in discrete mathematics, and has seen an outstanding growth during the last few decades.
Ahmed, Tanbir, Tanbir Ahmed
core  

Structures of Cycle Bases with Some Extremal Properties [PDF]

open access: yes, 2014
In this paper, authors investigate the structures of cycle bases with extremal properties which are related with map geometries, i.e., Smarandache 2-dimensional manifolds.
Han, Ren, Yun Bai, Han Ren, Bai, Yun
core   +1 more source

International Journal of Mathematical Combinatorics, Vol.1 [PDF]

open access: yes, 2007
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 460 pages approx.
Mao, Linfan (Editor-in-Chief)
core   +1 more source

On Graphs with Maximal Sum of α-th Degree Powers

open access: yesMathematics
Let G be a simple graph. The sum of the α-th degree powers of G, denoted by Mα(G), is obtained by summing the α-th powers of all vertex degrees. We use Gn,m to denote the set of all graphs having n vertices and m edges. Extremal problems concerning M2(G)
Bo-Jun Yuan, Jia-Jin Wang
doaj   +1 more source

Quasirandom Graphs and the Pantograph Equation. [PDF]

open access: yesAm Math Mon, 2021
Shapira A, Tyomkyn M.
europepmc   +1 more source

Combinatorial questions in optimal transport

open access: yes, 2020
Several problems in extremal combinatorics arise from a new generalization of the optimal coupling theorem to multiple random variables: Given a collection of random variables, it is possible to couple all of them so that any two differ with ...
Angel, Omer
core  

Absorptions in combinatorics

open access: yes
This thesis mainly focuses on the following transversal problem, which is closely related to the absorption technique in extremal combinatorics: Given a collection of simple graphs G1, . . . , Gt defined on the same vertex set V, where each graph Gi (1 ≤
Cheng, Yangyang
core   +1 more source

A superadditivity and submultiplicativity property for cardinalities of sumsets

open access: yes, 2010
For finite sets of integers A1, . . . ,An we study the cardinality of the n-fold sumset A1 + · · · + An compared to those of (n − 1)-fold sumsets A1 + · · · + Ai−1 + Ai+1 + · · · + An.
Matolcsi, Máté   +5 more
core   +1 more source

Local approaches to global problems in extremal combinatorics [PDF]

open access: yes, 2020
In this thesis we consider five problems in extremal combinatorics all of which which are all amenable to approaches based on local structure. The first part of this thesis looks at rainbow subgraphs at extremal thresholds.
Coulson, Matthew
core  

Advances on extremal problems in number theory and combinatorics

open access: yes, 2001
Ahlswede R. Advances on extremal problems in number theory and combinatorics. In: Casacuberta C, ed. European Congress of Mathematics : Barcelona, July 10 - 14, 2000. Progress in Mathematics. Vol 201.
Ahlswede, Rudolf, Casacuberta, Carles
core  

Home - About - Disclaimer - Privacy