A monotone path in an edge-ordered graph.
A Moore-like bound for graphs of diameter 2 and given degree, obtained as abelian lifts of dipoles.
A multilevel algorithm for force-directed graph-drawing.
A multinomial extension of an inequality of Haber.
A multipartite version of the Turan problem - density conditions and eigenvalues.
A multiplicity problem related to Schur numbers.
A multivariate arithmetic function of combinatorial and topological significance.
A multivariate interlace polynomial and its computation for graphs of bounded clique-width.
A multivariate Lagrange inversion formula for asymptotic calculations.
A natural extension of Catalan numbers.
A natural series for the natural logarithm.
A necessary and sufficient eigenvector condition for a connected graph to be bipartite.
A Neighborhood Condition for Fractional ID-[A, B]-Factor-Critical Graphs
Let G be a graph of order n, and let a and b be two integers with 1 ≤ a ≤ b. Let h : E(G) → [0, 1] be a function. If a ≤ ∑e∋x h(e) ≤ b holds for any x ∈ V (G), then we call G[Fh] a fractional [a, b]-factor of G with indicator function h, where Fh = {e ∈ E(G) : h(e) > 0}. A graph G is fractional independent-set-deletable [a, b]-factor-critical (in short, fractional ID-[a, b]- factor-critical) if G − I has a fractional [a, b]-factor for every independent set I of G. In this paper, it is proved...
A new algorithm for the four counterfeit coins problem.
A new algorithm for the three counterfeit coins problem.
A new and stronger central sets theorem
Furstenberg's original Central Sets Theorem applied to central subsets of ℕ and finitely many specified sequences in ℤ. In this form it was already strong enough to derive some very strong combinatorial consequences, such as the fact that a central subset of ℕ contains solutions to all partition regular systems of homogeneous equations. Subsequently the Central Sets Theorem was extended to apply to arbitrary semigroups and countably many specified sequences. In this paper we derive a new version...
A new approach to chordal graphs
By a chordal graph is meant a graph with no induced cycle of length . By a ternary system is meant an ordered pair , where is a finite nonempty set, and . Ternary systems satisfying certain axioms (A1)–(A5) are studied in this paper; note that these axioms can be formulated in a language of the first-order logic. For every finite nonempty set , a bijective mapping from the set of all connected chordal graphs with onto the set of all ternary systems satisfying the axioms (A1)–(A5) is...
A new approach to -Bernoulli numbers and -Bernoulli polynomials related to -Bernstein polynomials.
A New Approach to the Dynamic Maintenance of Maximal Points in a Plane.
A new approach to the Dyson coefficients.