Báo cáo toán học: "Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings" potx
Báo cáo toán học: "Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings" potx
... electronic journal of combinatorics 15 (2008), #R109 9
Tutte polynomial, subgraphs, orientations and
sandpile model: new connections via embeddings
Olivier Bernardi
∗
CNRS, Universit´e Paris-Sud, ... terms of subgraphs, orientations, outdegree sequences and sandpile
configurations. For instance, for any graph G, we obtain a bijection between con-
nected subgraphs (coun...
Báo cáo toán học: "Cycle index, weight enumerator, and Tutte polynomial" ppsx
... P. J. Cameron and D. G. Fon-Der-Flaass, Bases for permutation groups and matroids,
Europ. J. Combinatorics 16 (1995), 537–544.
[4] P. J. Cameron and D. E. Taylor, Stirling numbers and affine equivalence, ... the analogues of restriction and
contraction, and it specialises to the weight enumerators of each of the “elementary divisors”
of C (the two binary codes C mod 2 and (C ∩ 2Z...
Báo cáo toán học: "The polynomial part of a restricted partition function related to the Frobenius problem" pptx
... B
2i+1
= 0 for i>0, (−1)
j−1
B
j
= −B
j
for j>1, and (3) follows from (5) and (6).
✷
Remark. It is possible to avoid the use of complex analysis and give a purely formal power
series proof of the ... Frobenius problem, rational polytopes, and
Fourier–Dedekind sums, to appear in J. Number Theory.
[GJ] I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, New York...
Báo cáo toán học: "Regular spanning subgraphs of bipartite graphs of high minimum degree" docx
... bipartition {A, B}, and f(x) ≥ 0 an
integer valued function on A ∪ B. F has an f–factor if and only if
(i)
x∈A
f(x) =
y∈B
f(y)
and
(ii)
x∈X
f(x) ≤ e(X, Y ) +
y∈B−Y
f(y)
for all X ⊂ A and Y ⊂ B.
3 ... deleting every vertex of V −T and
the edges incident to them. Finally, K
r,s
is the complete bipartite graph on color classes
of size r and s for two positive integers r and...
Báo cáo toán học: "No Dense Subgraphs Appear in the Triangle-free Graph Process" potx
... Angelika Steger, and Anusch Taraz. The random
planar graph process. Random Structures Algorithms, 32(2):236–261, 2008.
[7] Svante Janson, Tomasz Luczak, and Andrzej Rucinski. Random graphs. Wiley-
Interscience ... On the size of a random maximal
graph. In Proceedings of the Sixth International Se minar on Random Graphs and
Probabilistic Methods in Com binatorics and Computer Science...
Báo cáo toán học: " Resource Allocation for Asymmetric Multi-Way Relay Communication over Orthogonal Channels" potx
... equiva-
lent to the left hand side in Condition (17) and the
condition in (47) is for the first N elements equiva-
lent to the right hand side in Condition (17). The
conditions (46) and (47) are always ... achievable. For the last case in (21) and (22)
Condition (17) is fulfilled and thus, the optimal rate
allocation and the corresponding rate are given by
(15) and (16), respectivel...
Báo cáo toán học: " Improved labelling of DTPA- and DOTA-conjugated peptides and antibodies with In-111 in HEPES and MES buffer" ppt
... radiolabelling: HEPES and MES, and compared this with the most
commonly used acetate buffers: sodium acetate and ammonium acetate, and showed that an
increased SA could be obtained when DTPA- and DOTA-conjugated ... labelling of DTPA- and DOTA-conjugated peptides and
antibodies with
111
In in HEPES and MES buffer
Maarten Brom*
1
, Lieke Joosten
1
, Wim JG Oyen
1
, Marti...
Báo cáo toán học: " Selective preparation of zero- and onedimensional gold nanostructures in a TiO2 nanocrystal-containing photoactive mesoporous template" pdf
... optical
devices and polarization filters [8,9,11]. Several methods
for synthesizing GNSs including 1-D GNSs have been
reported. These methods include photochemical and
electrochemical deposition [12,13] and ... [3,10,16].
On the other hand, the use of hard t emplates such as
anodic alumina and mesoporous silica for the synthesis of
1-D GNSs makes the complicated immobilization pro-
ce...
Báo cáo toán học: " Localization in mobile wireless and sensor networks" pot
... mobile wireless and sensor net-
works. Articles were solicited on both experimental and
theoretical aspects, including new positioning algorithms
and methodologies, system design and configurat ... sets (POCS) and outer approximation (OA)
techniques for us e in positioning, and then de velop di s-
tributed positioning algorithms based on POCS and OA.
Improvement of coverage a...
Báo cáo toán học: " On externally complete subsets and common fixed points in partially ordered sets" potx
... Abu-Sbeih and Khamsi: On externally complete subsets and common fixed points in partially
ordered sets. Fixed Point Theory and Applications 2011 2011:97.
Abu-Sbeih and Khamsi Fixed Point Theory and ... ∅
.
Finally, assume that we have (x
i
)
iÎI
and (y
j
)
jÎJ
in X such that the subsets ([x
i
, ® ))
iÎI
,
and ((¬, y
j
])
jÎJ
intersect 2-by-2 and
[x
i
, →
)
∩ M =
∅
and
(←, y...
Từ khóa: