34 citations · 64 across the 22 of their papers we have counts for
29 papers · 1 filter
Isolation of squares in graphs
Karl Bartolo, Peter Borg, Dayle Scicluna
Given a set of graphs, we call a copy of a graph in an -graph. The -isolation number of a graph , denoted by $ι(G,\mathcal{…
Isolation of regular graphs and -chromatic graphs
Peter Borg
Given a set of graphs, we call a copy of a graph in an -graph. The -isolation number of a graph , denoted by $ι(G,\mathcal{…
Isolation of regular graphs, stars and -chromatic graphs
Peter Borg
Given a set of graphs, we call a copy of a graph in an -graph. The -isolation number of a graph , denoted by $ι(G,\mathcal{…
Solution to a problem of Katona on counting cliques of weighted graphs
Peter Borg, Carl Feghali, Rémi Pellerin
A subset of the vertex set of a graph is called a -clique independent set of if no vertices in form a -clique of . An independent set is a -c…
Isolation of connected graphs
Peter Borg
For a connected -vertex graph and a set of graphs, let denote the size of a smallest set of vertices of such that the graph obtained…
The maximum sum of sizes of cross-intersecting families of subsets of a set
Peter Borg, Carl Feghali
A set of sets is called a family. Two families and of sets are said to be cross-intersecting if each member of intersects each member of $…