Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx

Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx

Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx

... antiranks of α satisfy an s-variant of the Nash-Williams conditions: s + j  i=1 r i (α) ≥ j. A Recurrence for Counting Graphical Partitions Tiffany M. Barnes ∗ Carla D. Savage † Department of Computer ... Graphen”, Match. 16 (1984) 3-17. [RA1] C. C. Rousseau and F. Ali, “On a conjecture concerning graphical partitions,” preprint, April 1994. [RA2] C. C. Rousseau and F. Ali, A n...
Ngày tải lên : 07/08/2014, 06:20
  • 10
  • 300
  • 0
Báo cáo toán học: "A recurrence for bounds on dominating sets in k-majority tournaments" pps

Báo cáo toán học: "A recurrence for bounds on dominating sets in k-majority tournaments" pps

... exists u ∈ A such that (u, v) ∈ E. Note that in a tournament it is always the case that A → B or B → A. If A = {a} and A → B we write a → B, and vice versa. For a linear order L on a set of vertices, ... If {a 1 , . . . , a m } does not dominate B, that means by the definition of (t, m)-ABMT’s that there is an element b ∈ B that does not have a greater index than a i...
Ngày tải lên : 08/08/2014, 14:23
  • 9
  • 217
  • 0
Báo cáo toán học: "A recurrence relation for the “inv” analogue of q-Eulerian polynomials" ppsx

Báo cáo toán học: "A recurrence relation for the “inv” analogue of q-Eulerian polynomials" ppsx

... A recurrence relation for the “inv” analogue of q-Eulerian polynomials Chak-On Chow Department of Mathematics and Information Technology, Hong Kong Institute of Education, 10 Lo Ping Road, Tai ... 70] A n+1 (t) = (1 + t )A n (t) + n−1  k=1  n k  A n−k (t )A k (t), satisfied by the classical Eulerian polynomials A n (t) :=  σ∈S n t des(σ) . 3 A combinatorial proof We give a...
Ngày tải lên : 08/08/2014, 11:20
  • 5
  • 360
  • 0
Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

Báo cáo toán học: "A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON" pptx

... the lattice (C, ⊆). A β INVARIANT FOR GREEDOIDS AND ANTIMATROIDS GARY GORDON Department of Mathematics Lafayette College Easton, PA 18042 gordong@lafayette.edu Submitted: November 12, 1996; Accepted: ... Accepted: March 28, 1997. Abstract. We extend Crapo’s β invariant from matroids to greedoids, con- centrating especially on antimatroids. Several familiar expansions for β(G) have greed...
Ngày tải lên : 07/08/2014, 06:20
  • 13
  • 285
  • 0
Báo cáo toán học: " A criterion for unimodality" docx

Báo cáo toán học: " A criterion for unimodality" docx

... Math., to appear. [2] BRENTI, F.: Log-concave and unimodal sequences in Algebra, Combinatorics and Geometry: an update. Contemporary Mathematics, 178, 71-84, 1994. [3] STANLEY, R.: Log-concave and ... R.: Log-concave and unimodal sequences in algebra, combinatorics and geometry. Graph theory and its applications: East and West (Jinan, 1986), 500-535, Ann. New York Acad. Sci., 576,NewYork,1989...
Ngày tải lên : 07/08/2014, 06:20
  • 4
  • 263
  • 0
Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx

Báo cáo toán học: " a construction for sets of integers with distinct subset sums" potx

... we can make an approximation of L ≈ .22001865 with an error of less than 1.5 ·10 −7 . Inequality (10) can certainly be used to obtain more precise approximations of L. the electronic journal of ... divide the argument into cases based on the dimension of v and the sequence of ρ i ’s. This argument is inductive; for all cases after Case 1 we are assuming that no smooth vector of smaller dime...
Ngày tải lên : 07/08/2014, 06:22
  • 14
  • 268
  • 0
Báo cáo toán học: "A Bound for Size Ramsey Numbers of Multi-partite Graphs" pot

Báo cáo toán học: "A Bound for Size Ramsey Numbers of Multi-partite Graphs" pot

... (2007), #N11 3 A Bound for Size Ramsey Numbers of Multi-partite Graphs Yuqin Sun and Yusheng Li ∗ Department of Mathematics, Tongji University Shanghai 200092, P. R. China xxteachersyq@163.com, ... Erd˝os, R. Faudree, C. Rousseau and R. Schelp, The size Ramsey numbers, Period. Math. Hungar. 9 (1978) 145–161. [3] P. Erd˝os and C. Rousseau, The size Ramsey number of a complete bipartite g...
Ngày tải lên : 07/08/2014, 13:21
  • 5
  • 278
  • 0
Báo cáo toán học: "A characterization for sparse ε-regular pairs" pps

Báo cáo toán học: "A characterization for sparse ε-regular pairs" pps

... regularity concept that has been introduced by Kohayakawa and R¨odl [7]. Following Kohayakawa and R¨odl, we say that a bipartite graph G = (A B, E) with density p = |E|/( |A| |B|) is (ε)-regular if ... for ε-regularity, that one can find in time n O(1/p) a partition guaranteed by the version of Szemer´edi’s lemma for sparse graphs that was introduced by Kohayakawa and R¨odl [7]. Note...
Ngày tải lên : 07/08/2014, 15:22
  • 12
  • 181
  • 0
Báo cáo toán học: "A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants" pps

Báo cáo toán học: "A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants" pps

... in this paragraph will be made precise in the following paragraphs. The parameters t g and p g arise in the univariate asymptotic enumeration of a variety of maps on surfaces and the parameters ... journal of combinatorics 17 (2010), #R155 4 A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants Zhicheng Gao ∗ School of Mathematics and...
Ngày tải lên : 08/08/2014, 12:23
  • 14
  • 333
  • 0
Từ khóa: