33 research outputs found
Solving Hard Graph Problems with Combinatorial Computing and Optimization
Many problems arising in graph theory are difficult by nature, and finding solutions to large or complex instances of them often require the use of computers. As some such problems are -hard or lie even higher in the polynomial hierarchy, it is unlikely that efficient, exact algorithms will solve them. Therefore, alternative computational methods are used. Combinatorial computing is a branch of mathematics and computer science concerned with these methods, where algorithms are developed to generate and search through combinatorial structures in order to determine certain properties of them. In this thesis, we explore a number of such techniques, in the hopes of solving specific problem instances of interest.
Three separate problems are considered, each of which is attacked with different methods of combinatorial computing and optimization. The first, originally proposed by ErdH{o}s and Hajnal in 1967, asks to find the Folkman number , defined as the smallest order of a -free graph that is not the union of two triangle-free graphs. A notoriously difficult problem associated with Ramsey theory, the best known bounds on it prior to this work were . We improve the upper bound to using a combination of known methods and the Goemans-Williamson semi-definite programming relaxation of MAX-CUT. The second problem of interest is the Ramsey number , which is the smallest such that any -vertex graph contains a cycle of length four or an independent set of order . With the help of combinatorial algorithms, we determine and using large-scale computations on the Open Science Grid. Finally, we explore applications of the well-known Lenstra-Lenstra-Lov\u27{a}sz (LLL) algorithm, a polynomial-time algorithm that, when given a basis of a lattice, returns a basis for the same lattice with relatively short vectors. The main result of this work is an application to graph domination, where certain hard instances are solved using this algorithm as a heuristic
Common extremal graphs for three inequalities involving domination parameters
‎Let ‎, ‎ and ‎ ‎be the minimum degree‎, ‎maximum degree and‎ ‎domination number of a graph ‎, ‎respectively‎. ‎A partition of ‎, ‎all of whose classes are dominating sets in ‎, ‎is called a domatic partition of ‎. ‎The maximum number of classes of‎ ‎a domatic partition of is called the domatic number of ‎, ‎denoted ‎. ‎It is well known that‎ ‎‎, ‎ cite{ch}‎, ‎and cite{berge}‎. ‎In this paper‎, ‎we investigate the graphs for which‎ ‎all the above inequalities become simultaneously equalities‎
Characterizing subgroup perfect codes by 2-subgroups
A perfect code in a graph is a subset of such that
no two vertices in are adjacent and every vertex in
is adjacent to exactly one vertex in . Let be a finite group and a
subset of . Then is said to be a perfect code of if there exists a
Cayley graph of admiting as a perfect code. It is proved that a
subgroup of is a perfect code of if and only if a Sylow
-subgroup of is a perfect code of . This result provides a way to
simplify the study of subgroup perfect codes of general groups to the study of
subgroup perfect codes of -groups. As an application, a criterion for
determining subgroup perfect codes of projective special linear groups
is given