Three aspects of partitions.
Three classes of diameter edge-invariant graphs
Three edge-coloring conjectures
The focus of this article is on three of the author's open conjectures. The article itself surveys results relating to the conjectures and shows where the conjectures are known to hold.
Three generalizations of Weyl's denominator formula.
Three new heuristics for the Steiner problem in graphs.
Three Notes on Permutations.
Three recitations on holonomic systems and hypergeometric series.
Three restricted product-sum partition functions
Three-and-more set theorems
In this paper we generalize classical 3-set theorem related to stable partitions of arbitrary mappings due to Erdős-de Bruijn, Katětov and Kasteleyn. We consider a structural generalization of this result to partitions preserving sets of inequalities and characterize all finite sets of such inequalities which can be preserved by a “small” coloring. These results are also related to graph homomorphisms and (oriented) colorings.
Three-dimensional 1-bend graph drawings.
Three-dimensional pseudomanifolds on eight vertices.
Three-letter-pattern avoiding permutations and functional equations.
Three-linking in Eulerian digraphs
Threshold functions for the bipartite Turán property.
Thue-like sequences and rainbow arithmetic progressions.
Tight bounds on the algebraic connectivity of a balanced binary tree.
Tight estimates for eigenvalues of regular graphs.
Tight upper bounds for the domination numbers of graphs with given order and minimum degree.
Tight upper bounds for the domination numbers of graphs with given order and minimum degree. II.
Tiling a -board with squares and dominoes.