An approximation algorithm for the total covering problem
We introduce a 2-factor approximation algorithm for the minimum total covering number problem.
An area-to-inv bijection between Dyck paths and 312-avoiding permutations.
An asymptotic expansion for the Catalan-Larcombe-French sequence.
An asymptotic expansion for the number of permutations with a certain number of inversions.
An asymptotic formula in the theory of compositions.
An Asymptotic Formula in the Theory of Compositions. (Short Communication).
An asymptotic Gilbert-Varshamov bound for -nets.
An asymptotic result for the path partition conjecture.
An Attempt at Frankl's Conjecture
An attractive class of bipartite graphs
In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.
An axiomatic approach to metric properties of connected graphs
An easy proof of the limit in the random assignment problem.
An edge-minimization problem for regular polygons.
An efficient algorithm for the transversal hypergraph generation.
An efficient -centroid location algorithm for cographs.
An eigenvalue characterization of antipodal distance-regular graphs.
An elementary chromatic reduction for gain graphs and special hyperplane arrangements.
An elementary proof of a congruence by Skula and Granville
Let be a prime, and let be the Fermat quotient of to base . The following curious congruence was conjectured by L. Skula and proved by A. Granville In this note we establish the above congruence by entirely elementary number theory arguments.
An elementary proof of the hook formula.
An Elementary Set Partition Problem.