Báo cáo toán học: "Vertex-transitive q-complementary uniform hypergraphs" pot

... hypergraphs containing neither. Example 1 Clearly not every mixed hypergraph is planar. Let H 7 be the 3 -uniform hypergraph with vertex-set V (H 7 )=Z 7 , and edge-set E(H 7 )={{0+i, 1+i, 3+i}, {0+i, 2+i, ... without edges of size 2. The first interesting case is that in which H =(V,C, D) is a maximal 3 -uniform planar bi-hypergraph. These graphs already have a rich structure that will allo...

Ngày tải lên: 07/08/2014, 06:22

... Recently, Qin, Yang and Liu [10] showed the exis- tence of uniform attractors by uniform condition-(C) and weak continuous method to obtain uniformly asymptotical compactness in H 1 and H 2 , Yue ... functions, we have in this paper established the uniformly asymptotical compactness of the processes {U(t, τ)}(t ≥ τ, τ Î R) to obtain the existence of the uniform attractor of the 3D non-a...

Ngày tải lên: 20/06/2014, 21:20

... for strongly-embeddable 3 -uniform planar bihypergraphs such that their strong embeddings do not contain parallel edges (Theorem 4). Proper colorings of a strongly-embeddable 3- uniform planar bihypergraph ... chromatic number of a planar mixed hypergraph is at least a given number even for strongly-embeddable 3 -uniform planar bihypergraphs such that their embeddings do not contain paral...

Ngày tải lên: 07/08/2014, 06:22

... inductive hypothesis there exists a (k − 1)- subset X ⊂ [n] \ {x 1 } such that F x 1 | X contains C − k−1 . Just by removing these sets one after the other and repeatedly using the inductive hypothesis ... [n] : |F| < k} and {F ⊆ [n] : |F | > n − k}. In this note we consider the corresponding k -uniform problem and prove that the conjecture of Frankl and Pach becomes true in this scena...

Ngày tải lên: 07/08/2014, 21:21

... k-noncrossing, σ-modular diagrams with uniform probability. Our construction is motivated by the ideas of [5], where a combinatorial algorithm has been presented that uniformly generates k- noncrossing ... j ≤ k − 1, induce a locally uniform Markov-process (X i ) i whose sampling paths are shape-sequences (µ i ) i . Let Rand(µ i ) denote the random process of locally uniformly choosing X...

Ngày tải lên: 08/08/2014, 12:23

... is 3 -uniform, this corresponds to the term triangle-dual used by Ziff and Scullard. To illustrate, in Figure 1 we provide three examples o f infinite connected planar periodic self-dual 3 -uniform ... f the lattice L G generated from G. Given a planar generator G and a connected periodic self-dual 3 -uniform hypergraph H, a dual pair of periodic lattices may be constructed a s follows: Const...

Ngày tải lên: 08/08/2014, 14:22

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:20

... ,R n by this process: R 1 is the usual first row for a normalized square. For i =2, ,n, R i is chosen uniformly at 3 LATIN SQUARES OF ORDER 10 Submitted: August 20, 1995; Accepted: August 25, 1995 (revised) Brendan

Ngày tải lên: 07/08/2014, 06:20