Báo cáo toán học: " On randomly generated non-trivially intersecting hypergraphs" ppsx
Báo cáo toán học: "On Randomly Generated Intersecting Hypergraphs" pps
... electronic journal of combinatorics 10 (2003), #R29 4
On Randomly Generated Intersecting Hypergraphs
Tom Bohman
∗
Carnegie Mellon University,
tbohman@andrew.cmu.edu
Colin Cooper
Kings College,London
ccooper@dcs.kcl.ac.uk
Alan ... that F
m
has the same distribution as
m distinct randomly chosen r-sets, conditional on the event (of probability
1−o(1)) that F
m
is intersecting. To s...
Báo cáo toán học: " On randomly generated non-trivially intersecting hypergraphs" ppsx
... produces a non-trivially intersecting hypergraph while
the second one is the same as the original process of Bohman et al. as long as it is
possible that the process results a non-trivially intersecting ... hypergraph.
Proposition 2.2 If an intersecting hypergraph H contains an r-tria ng le, then there is
only one maximal intersecting hypergraph H
∗
containing H and H
∗
is a 2-3-h...
Báo cáo toán học: "On the smoothness of sphere extensions " ppsx
... class="bi x0 y0 w1 h 1" alt =""
Báo cáo toán học: "On Toeplitz operators with loops. II." ppsx
... h 1" alt =""
Báo cáo toán học: "On a Strange Recursion of Golomb" ppsx
... distinct permutations β of α.
The sequences defined in the statement of Proposition 3.2 satisfy conditions (1) and
(2). Conditions (3) and (4) are imposed by the restriction that all partitions α are ... transformations leads one to ask whether combinatorial
objects and constructions exist for each expression so that one can obtain generalized
Stockhausen sequences directly. In this section, w...
Báo cáo toán học: "On sums over partially ordered sets" ppsx
... which is due
to an anonymous referee, uses downward induction on x
0
, while the second proof,
which is due to the author, uses the principle of inclusion-exclusion and additionally
requires that ... Improved inclusion-exclusion identities and inequalities based on a
particular class of abstract tubes, Electron. J. Probab. 4 (1999), paper # 5.
[6] K. Dohmen, Inclusion-exclusion and networ...
Báo cáo toán học: "On Descents in Standard Young Tableaux" ppsx
... number only once. Figure 1 shows
a standard Young tableau of shape (4, 3, 2). To every λ there corresponds a conjugate
partition (cf. [ECII], Section 7.2) which will be denoted λ
. The conjugate ... are constrained,
specifically Table 4 contains restrictions built up from two pairs and Table 3 contains the
rest. Again, one is easily convinced that these are all the cases.
The electronic jour...
Báo cáo toán học: "On Feasible Sets of Mixed Hypergraphs" doc
... them can have exponentially many vertices in terms of max F
and |F|. The second construction from [6] does not even give one-realization of F.We
present an algorithmic construction (Theorem 2) ... ,r
m
). Note that the condition r
1
= 0 is the condition
1 ∈ F mentioned earlier. We generalize this theorem in Section 3. We prove that for
each vector (r
1
, ,r
m
) of non-negative integers ... o...
Báo cáo toán học: "On the first occurrence of strings" ppsx
... σ
) = n − L
n
(σ, σ
).
One construction takes care of the case that σ
2
is one of these four strings,
[0]
∗
, [0]
∗
1, [1]
∗
, [1]
∗
0,
where, for notational convenience, we write a repeating ... 2
n−2
+ 2
n−3
, and we have our contradiction.
If c
= 1 then σ
1
◦ σ
2
− σ
1
◦ σ
2
< σ
2
◦ σ
2
− σ
2
◦ σ
1
, contradicting an hypothesis of our
construction.
Consider the case when c = 1 and...
Báo cáo toán học: "On Multivariate Chromatic Polynomials of Hypergraphs and Hyperedge Elimination" docx
... graph-theoretic operations - deletion,
contraction, and extraction. Extraction does not appear to be a matroidal operation. In
fact, not all trees on n vertices have the same edge elimination polynomial, ... elimination polynomial. An
example of deletion, contraction, and extraction is given in Figure 1. When H is a graph
(all hyperedges are 2-edges), deletion and contraction are already fa...
Từ khóa: