This text is aimed at doctoral students and researchers, who are interested in Combinatorics
and Graph Theory or who would just like to learn about some active topics and trends. But …

Packing a maximum number of disjoint triangles into a given graph G is NP-hard, even for
most classes of structured graphs. In contrast, we show that packing a maximum number of …

The maximum induced matching problem is known to be APX-hard in the class of bipartite
graphs. Moreover, the problem is also intractable in this class from a parameterized point of …

We give a general result on the average-case performance of certain greedy algorithms.
These are derived from algorithms in which the possible operations performed at each step …

Structural Properties of Sparse Graphs Page 1 BOLYAI SOCIETY Building Bridges
MATHEMATICAL STUDIES, 19 pp. 369–426. Structural Properties of Sparse Graphs …

An induced matching of a graph G is a set M of edges of G such that every two vertices of G
that are incident with distinct edges in M have distance at least 2 in G. The maximum number …

We investigate the maximum induced matching problem (MIM), which is the problem of
finding an induced matching having the largest cardinality on an undirected graph. The …

An independent packing of triangles is a set of pairwise disjoint triangles, no two of which
are joined by an edge. A triangle bramble is a set of triangles, every pair of which intersect or …

Пусть H—фиксированное множество связных графов. H-упаковкой графа G называется
множество S={G1, G2,..., Gm} попарно не пересекающихся подграфов графа G, каждый …

In this paper we consider the problem of finding large collections of vertices and edges
satisfying particular separation properties in random regular graphs of degree r, for each …