Báo cáo toán học: "The number of graphs not containing K3,3 as a minor" pptx
Báo cáo toán học: "The number of graphs not containing K3,3 as a minor" pptx
... Hence, the class of (maximal) planar graphs is contained in the class of maximal
K
3,3
-minor-free graphs and we can use the number of planar graphs and the number of
triangulations as lower bounds. ... number of planar graphs. Already in
1962, the asymptotic number of triangulations was given by Tutte [15]. Investigating how
much the number of planar graphs...
Báo cáo toán học: "The Number of Labeled 2-Connected Planar Graphs" ppsx
... Gao
∗
School of Mathematics and Statistics
Carleton University
Ottawa K1S 5B6, Canada
zgao@math.carleton.ca
Nicholas C. Wormald
†
Department of Mathematics and Statistics
University of Melbourne
VIC ... single graph may have many embeddings, there are generally fewer planar graphs
than there are maps. In this paper, we study the number of labeled 2-connected
planar graphs with...
Báo cáo toán học: "The Number of Solutions of X 2 = 0 in Triangular Matrices Over GF" pdf
... The Number of Solutions of X
2
=0in Triangular Matrices Over GF(q)
Shalosh B. EKHAD
1
and Doron ZEILBERGER
1
Abstract: We prove an explicit formula for the number of n × n upper triangular matrices, ... over
GF(q), whose square is the zero matrix. This formula was recently conjectured by Sasha Kirillov
and Anna Melnikov [KM].
Theorem. The number of n × n upper-triangular matrice...
Báo cáo toán học: "The Number of Permutation Binomials Over F4p+1 where p and 4p + 1 are Primes" doc
... binomials,
Proceedings of the American Mathematical Society 134 (2006), no 1, 15-22.
[2] A. Akbary and Q. Wang, On some permutation polynomials over finite fields, Inter-
national Journal of Mathematics and Mathematical ... journal of combinatorics 13 (2006), #R65 8
The Number of Permutation Binomials
Over F
4p+1
where p and 4p + 1 are Primes
A. Masuda, D. Panario
∗
and Q. Wang
∗
Sc...
Báo cáo toán học: "The number of 0-1-2 increasing trees as two different evaluations of the Tutte polynomial of a complete graph" potx
... The number of 0-1-2 increasing trees as two different
evaluations of the Tutte polynomial of a complete graph
C. Merino
∗
Instituto de Matem´aticas,
Universidad Nacional Aut´onoma de M´exico,
Circuito ... present an algebraic proof of a result
with the same flavour as the latter: T
n+2
(1, −1) = T
n
(2, −1), where T
n
(1, −1) has
the combinatorial interpretation of being the...
![Báo cáo toán học: " The Number of [Old-Time] Basketball Games with Final Score n:n where the Home Team was never losing but also never ahead by more than w Point" pot](https://media.store123doc.com/images/document/2014_08/07/medium_fbh1407399746.jpg)
Báo cáo toán học: " The Number of [Old-Time] Basketball Games with Final Score n:n where the Home Team was never losing but also never ahead by more than w Point" pot
... the Catalan numbers [St].
3 The Main Result - Basketball Games
Definition 1 An [ij] walk is a walk that starts at the line y = i and ends at the line
y = j.
Definition 2 An irreducible [ij] walk ... journal of combinatorics 14 (2007), #R19 3
The Number of [Old-Time] Basketball Games with
Final Score n:n where the Home Team was never
losing but also never ahead by more than w Points
Arvi...
Báo cáo toán học: "Repetition number of graphs" pot
... n-vertex graphs. The maximum
is n whenever the class contains a regular graph. Some classes we study (trees, maximal
outerplanar graphs, planar triangulations) have no regular graphs, but they have ... restricted families of graphs.
We show that it is asymptotically sharp for several natural families of sparse graphs.
Theorem 2.5 Among n-vertex graphs, the bound from Lemma 2.1 i...
Báo cáo toán học: "The number of elements in the mutation class of a quiver of type Dn Aslak Bakke Buan" pps
... mutation class of a quiver
of type D
n
and triangulations up to rotation and
inverting tags
Here we adapt the methods and ideas of [T] to obtain a bijection between the mutation
class of a quiver ... with mutation o f triangulations. Mutating a triangulation at a given diagonal
is defined as removing this diagonal and replacing it with another one to obtain a new
triangul...
Báo cáo toán học: "The Number of Positions Starting a Square in Binary Words" pps
... Let
A = {a, b, c} be a ternary alphabet, and B = {0, 1} a binary alphabet. For a binary
word w = a
1
a
2
· · · a
n
∈ B
∗
with a
i
∈ B, we say that a position i ∈ {1, 2, . . ., n} starts a
square, ... at least 4 letters co ntains a square. A. S. Fraenkel and J. Simp-
son [2, 1] studied the number of distinct squares in binary word; see also Ilie [4], where it
was sho...
Báo cáo toán học: "The number of F -matchings in almost every tree is a zero residue" ppt
... -matchings will be a zero residue in that pro ba bility space as well.
As a concrete example, let P
n
be the random planar graph of order n, that is, P
n
is the set of all simple labeled planar ... by any constant m. This may serve as an explanation for the hardness
of obtaining distribution results.
Both independent sets and matchings are special cases of F -matchings. Let...
Từ khóa: