Results 71 to 80 of about 238 (93)

On the number of $\mathcal {H}$ -free hypergraphs

Forum of Mathematics, Sigma
Two central problems in extremal combinatorics are concerned with estimating the number $\mathrm {ex}(n,\mathcal {H})$ , the size of the largest $\mathcal {H}$ -free hypergraph on n vertices, and the number $\mathrm {forb}(n,\mathcal {H})$
Tao Jiang, Sean Longbrake
doaj   +1 more source

New upper bounds on the order of cages

Electronic Journal of Combinatorics, 1996
F. Lazebnik, V. Ustimenko, A. Woldar
semanticscholar   +1 more source

An isoperimetric theorem on the cube and the Kintchine-Kahane inequalities

, 1988
M. Talagrand
semanticscholar   +1 more source

On the δ-chromatic numbers of the Cartesian products of graphs

Open Mathematics
In this work, we study the δ\delta -chromatic number of a graph, which is the chromatic number of the δ\delta -complement of a graph. We give a structure of the δ\delta -complements and sharp bounds on the δ\delta -chromatic numbers of the Cartesian ...
Tangjai Wipawee, Pho-on Witsarut, Vichitkunakorn Panupong   +2 more
doaj   +1 more source

Extremal values on Zagreb indices of trees with given distance k-domination number. [PDF]

J Inequal Appl, 2018
Pei L, Pan X.
europepmc   +1 more source

On Properties of Distance-Based Entropies on Fullerene Graphs. [PDF]

Entropy (Basel), 2019
Ghorbani M, Dehmer M, Rajabi-Parsa M, Mowshowitz A, Emmert-Streib F.   +4 more
europepmc   +1 more source

Some new sharp bounds for the spectral radius of a nonnegative matrix and its application. [PDF]

J Inequal Appl, 2017
He J, Liu YM, Tian JK, Liu XH.
europepmc   +1 more source

The F-coindex of some graph operations. [PDF]

Springerplus, 2016
De N, Nayeem SM, Pal A.
europepmc   +1 more source

Minimum-Loop Realization of Degree Sequences. [PDF]

J Res Natl Bur Stand (1977), 1982
Goldman AJ, Byrd RH.
europepmc   +1 more source

Functions on adjacent vertex degrees of trees with given degree sequence

Open Mathematics, 2014
Wang Hua
doaj   +1 more source