Results 1  10
of
26,135
On the maximum number . . .
, 2008
"... Given a finite set P ⊆ R d, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in R d. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) = ..."
Abstract
 Add to MetaCart
Given a finite set P ⊆ R d, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in R d. We give the exact value of tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n
On the maximum number of translates
, 2008
"... Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. Wegivetheexactvalueof tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) =n − mr ( ..."
Abstract
 Add to MetaCart
Given a finite set P ⊆ Rd, called a pattern, tP (n) denotes the maximum number of translated copies of P determined by n points in Rd. Wegivetheexactvalueof tP (n) when P is a rational simplex, that is, the points of P are rationally affinely independent. In this case, we prove that tP (n) =n − mr
On the maximum number of cliques in a graph
, 2006
"... Abstract. A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for various graph classes. For example, we prove that the maximum number of cliques in a planar graph with n vertices is 8(n − 2). 1. ..."
Abstract

Cited by 15 (6 self)
 Add to MetaCart
Abstract. A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for various graph classes. For example, we prove that the maximum number of cliques in a planar graph with n vertices is 8(n − 2). 1.
On the maximum number of decoherent histories
 Phys. Lett. 203 A
, 1995
"... bulletin board ref.: grqc/9409028 It is shown that N 2 is the upper limit for the number of histories in a decohering family of Nstate quantum system. Simple criterion is found for a family of N 2 fine grained decohering histories of GellMann and Hartle to be identical with a family of Griffiths ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
bulletin board ref.: grqc/9409028 It is shown that N 2 is the upper limit for the number of histories in a decohering family of Nstate quantum system. Simple criterion is found for a family of N 2 fine grained decohering histories of GellMann and Hartle to be identical with a family of Griffiths
On the maximum number of fivecycles . . .
, 2012
"... Using Razborov’s flag algebras we show that a trianglefree graph on n vertices contains at most n ..."
Abstract
 Add to MetaCart
Using Razborov’s flag algebras we show that a trianglefree graph on n vertices contains at most n
Maximum Number of Participants:
"... Through handson exploration, participants will discover different types of animal signs that are used to learn about and track animals big and small. ..."
Abstract
 Add to MetaCart
Through handson exploration, participants will discover different types of animal signs that are used to learn about and track animals big and small.
THE MAXIMUM NUMBER OF 2 × 2 ODD
"... Abstract. Let A be an m×n, (0, 1)matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2×2 odd submatrices in a (0, 1)matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal number ..."
Abstract
 Add to MetaCart
Abstract. Let A be an m×n, (0, 1)matrix. A submatrix of A is odd if the sum of its entries is an odd integer and even otherwise. The maximum number of 2×2 odd submatrices in a (0, 1)matrix is related to the existence of Hadamard matrices and bounds on Turán numbers. Pinelis [On the minimal
AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS
, 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract

Cited by 702 (1 self)
 Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.
THE MAXIMUM NUMBER OF 2 × 2ODDSUBMATRICESIN
"... Abstract. Let A be an m × n, (0, 1)matrix.A submatrix of A is odd if the sum of its entries is anoddintegerandevenotherwise.Themaximumnumberof2×2 odd submatrices in a (0, 1)matrix is related to the existence of Hadamard matrices and bounds on Turán numbers.Pinelis [On the minimal number of even su ..."
Abstract
 Add to MetaCart
the maximum number of 2 × 2 odd submatrices in an m × n (0, 1)matrix.Moreover, formulas are determined that yield the exact maximum counts with one exception, in which case upper and lower bounds are given.These results extend and refine those of Pinelis. Key words. (0, 1)matrices, Even and odd matrices
Results 1  10
of
26,135