11 research outputs found
On Selkow's bound on the independence number of graphs
For a graph G with vertex set V (G) and independence number α(G), Selkow [A Probabilistic lower bound on the independence number of graphs, Discrete Math. 132 (1994) 363–365] established the famous lower bound ∑v∈V(G)1d(v)+1(1+max{d(v)d(v)+1-∑u∈N(v)1d(u)+1,0}) on α (G), where N(v) and d(v) = |N(v)| denote the neighborhood and the degree of a vertex v ∈ V (G), respectively. However, Selkow’s original proof of this result is incorrect. We give a new probabilistic proof of Selkow’s bound here
New bounds on domination and independence in graphs
We propose new bounds on the domination number and on the independence number
of a graph and show that our bounds compare favorably to recent ones. Our
bounds are obtained by using the Bhatia-Davis inequality linking the variance,
the expected value, the minimum, and the maximum of a random variable with
bounded distribution
On vertex independence number of uniform hypergraphs
Abstract
Let H be an r-uniform hypergraph with r ≥ 2 and let α(H) be its vertex independence number. In the paper bounds of α(H) are given for different uniform hypergraphs: if H has no isolated vertex, then in terms of the degrees, and for triangle-free linear H in terms of the order and average degree.</jats:p
Algorithms for the Maximum Independent Set Problem
This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs.
We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in:
+ some subclasses of -free graphs (thus generalizing the classical result for -free graphs);
+ some subclasses of -free graphs (thus generalizing the classical results for subclasses of P5-free graphs);
+ some subclasses of -free graphs and -free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs.
Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of -free graphs and a subclass of -free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for -free graphs or banner-free graphs, for some more general graph classes.
We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem.
We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for -free graphs, to give polynomial solutions for some subclasses of -free graphs and -free graphs.
We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered.
Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of -free subcubic graphs
Problems in extremal and combinatorial geometry
This thesis deals with three families of optimization problems: (1) Euclidean optimization problems on random point sets; (2) independent sets in hypergraphs; and (3) packings in point lattices. First, we consider bounds on several monochromatic and bichromatic optimization problems including minimum matching, minimum spanning trees, and the travelling salesman problem. Many of these problems lend themselves to representations in terms of hierarchically separated trees | trees with uniform branching factor and depth, and having edge weights exponential in the depth of the edge in the tree. In the second part, we consider the independent set problem on uniform hypergraphs, in anticipation of applying it to the third part, packing problems on point lattices. In these problems we wish to select a subset of points from an n n ::: n grid avoiding particular patterns. We also study several generalizations of these problems that have not been handled previously.M.S., Computer Science -- Drexel University, 201
Graph theoretic generalizations of clique: optimization and extensions
This dissertation considers graph theoretic generalizations of the maximum
clique problem. Models that were originally proposed in social network analysis literature, are investigated from a mathematical programming perspective for the first
time. A social network is usually represented by a graph, and cliques were the first
models of "tightly knit groups" in social networks, referred to as cohesive subgroups.
Cliques are idealized models and their overly restrictive nature motivated the development of clique relaxations that relax different aspects of a clique. Identifying large
cohesive subgroups in social networks has traditionally been used in criminal network
analysis to study organized crimes such as terrorism, narcotics and money laundering.
More recent applications are in clustering and data mining wireless networks, biological networks as well as graph models of databases and the internet. This research
has the potential to impact homeland security, bioinformatics, internet research and
telecommunication industry among others.
The focus of this dissertation is a degree-based relaxation called k-plex. A
distance-based relaxation called k-clique and a diameter-based relaxation called k-club are also investigated in this dissertation. We present the first systematic study
of the complexity aspects of these problems and application of mathematical programming techniques in solving them. Graph theoretic properties of the models are
identified and used in the development of theory and algorithms.
Optimization problems associated with the three models are formulated as binary integer programs and the properties of the associated polytopes are investigated. Facets and valid inequalities are identified based on combinatorial arguments.
A branch-and-cut framework is designed and implemented to solve the optimization
problems exactly. Specialized preprocessing techniques are developed that, in conjunction with the branch-and-cut algorithm, optimally solve the problems on real-life
power law graphs, which is a general class of graphs that include social and biological
networks. Computational experiments are performed to study the effectiveness of the
proposed solution procedures on benchmark instances and real-life instances.
The relationship of these models to the classical maximum clique problem is
studied, leading to several interesting observations including a new compact integer
programming formulation. We also prove new continuous non-linear formulations for
the classical maximum independent set problem which maximize continuous functions
over the unit hypercube, and characterize its local and global maxima. Finally, clustering and network design extensions of the clique relaxation models are explored
Cliques, Degrees, and Coloring: Expanding the ω, Δ, χ paradigm
Many of the most celebrated and influential results in graph coloring, such as Brooks' Theorem and Vizing's Theorem, relate a graph's chromatic number to its clique number or maximum degree. Currently, several of the most important and enticing open problems in coloring, such as Reed's Conjecture, follow this theme.
This thesis both broadens and deepens this classical paradigm.
In Part~1, we tackle list-coloring problems in which the number of colors available to each vertex depends on its degree, denoted , and the size of the largest clique containing it, denoted . We make extensive use of the probabilistic method in this part.
We conjecture the ``list-local version'' of Reed's Conjecture, that is every graph is -colorable if is a list-assignment such that
for each vertex and , and we prove this for under some mild additional assumptions.
We also conjecture the `` version'' of Reed's Conjecture, even for list-coloring. That is, for , every graph satisfies
\chi_\ell(G) \leq \lceil (1 - \varepsilon)(\mad(G) + 1) + \varepsilon\omega(G)\rceil,
where is the maximum average degree of . We prove this conjecture for small values of , assuming . We actually prove a stronger result that improves bounds on the density of critical graphs without large cliques, a long-standing problem, answering a question of Kostochka and Yancey. In the proof, we use a novel application of the discharging method to find a set of vertices for which any precoloring can be extended to the remainder of the graph using the probabilistic method. Our result also makes progress towards Hadwiger's Conjecture: we improve the best known bound on the chromatic number of -minor free graphs by a constant factor.
We provide a unified treatment of coloring graphs with small clique number. We prove that for sufficiently large, if is a graph of maximum degree at most with list-assignment such that for each vertex ,
and , then is -colorable. This result simultaneously implies three famous results of Johansson from the 90s, as well as the following new bound on the chromatic number of any graph with and for sufficiently large:
In Part~2, we introduce and develop the theory of fractional coloring with local demands. A fractional coloring of a graph is an assignment of measurable subsets of the -interval to each vertex such that adjacent vertices receive disjoint sets, and we think of vertices ``demanding'' to receive a set of color of comparatively large measure. We prove and conjecture ``local demands versions'' of various well-known coloring results in the paradigm, including Vizing's Theorem and Molloy's recent breakthrough bound on the chromatic number of triangle-free graphs.
The highlight of this part is the ``local demands version'' of Brooks' Theorem. Namely, we prove that if is a graph and such that every clique in satisfies and every vertex demands , then has a fractional coloring in which the measure of for each vertex is at least . This result generalizes the Caro-Wei Theorem and improves its bound on the independence number, and it is tight for the 5-cycle