Displaying 61 – 80 of 374

Showing per page

Partial covers of graphs

Jirí Fiala, Jan Kratochvíl (2002)

Discussiones Mathematicae Graph Theory

Given graphs G and H, a mapping f:V(G) → V(H) is a homomorphism if (f(u),f(v)) is an edge of H for every edge (u,v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a practical problem of assigning frequencies to transmitters without interference. We compare the problems of...

Partial Ovoids and Partial Spreads of Classical Finite Polar Spaces

De Beule, J., Metsch, K., Klein, A., Storme, L. (2008)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 05B25, 51E20.We survey the main results on ovoids and spreads, large maximal partial ovoids and large maximal partial spreads, and on small maximal partial ovoids and small maximal partial spreads in classical finite polar spaces. We also discuss the main results on the spectrum problem on maximal partial ovoids and maximal partial spreads in classical finite polar spaces.The research of the fourth author was also supported by the Project Combined algorithmic...

Partial sum of eigenvalues of random graphs

Israel Rocha (2020)

Applications of Mathematics

Let G be a graph on n vertices and let λ 1 λ 2 ... λ n be the eigenvalues of its adjacency matrix. For random graphs we investigate the sum of eigenvalues s k = i = 1 k λ i , for 1 k n , and show that a typical graph has s k ( e ( G ) + k 2 ) / ( 0 . 99 n ) 1 / 2 , where e ( G ) is the number of edges of G . We also show bounds for the sum of eigenvalues within a given range in terms of the number of edges. The approach for the proofs was first used in Rocha (2020) to bound the partial sum of eigenvalues of the Laplacian matrix.

Partial unconditionality of weakly null sequences.

Jordi López Abad, Stevo Todorcevic (2006)

RACSAM

We survey a combinatorial framework for studying subsequences of a given sequence in a Banach space, with particular emphasis on weakly-null sequences. We base our presentation on the crucial notion of barrier introduced long time ago by Nash-Williams. In fact, one of the purposes of this survey is to isolate the importance of studying mappings defined on barriers as a crucial step towards solving a given problem that involves sequences in Banach spaces. We focus our study on various forms of ?partial...

Currently displaying 61 – 80 of 374