The anti-Ramsey number ar(G,H) with input graph G and pattern graph H, is the maximum positive integer k such that there exists an edge coloring of G using k colors, in which there are no rainbow subgraphs isomorphic to ...

Representation of graphs as the intersection graphs of geometric objects has a long history. The objective is to a nd a collection of \simple" sets S such that a given graph G is its intersection graph. We are interested ...

Graphs have been extensively used for modelling real-world network datasets, however, they are restricted to pairwise relationships, i.e., each edge connects exactly two vertices. Hypergraphs relax the notion of edges ...