Search
Now showing items 1-3 of 3
Problems on bend-number, circular separation dimension and maximum edge 2-colouring
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 ...
Deep Learning over Hypergraphs
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 ...
Improved approximation bounds on maximum edge q coloring of dense graphs
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 ...