35 citations · 93 across the 20 of their papers we have counts for
24 papers
Model Graph Inductive Learning for Knowledge Graph Completion
Mohommad Esmaei Khani, Mahdieh Hasheminejad, Ali Taherkhani +1
Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations. However, most existing methods derive these embeddings by…
FunQG: Molecular Representation Learning Via Quotient Graphs
Hossein Hajiabolhassan, Zahra Taheri, Ali Hojatnia +1
Learning expressive molecular representations is crucial to facilitate the accurate prediction of molecular properties. Despite the significant advancement of graph neural networks…
Chromatic Number of Random Kneser Hypergraphs
Meysam Alishahi, Hossein Hajiabolhassan
Recently, Kupavskii~[{\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\rm 2016}.}] investigated the chromatic number of random Kneser graphs…
A Generalization of Gale's lemma
Meysam Alishahi, Hossein Hajiabolhassan
In this work, we present a generalization of Gale's lemma. Using this generalization, we introduce two combinatorial sharp lower bounds for and ${\rm…
Strengthening topological colorful results for graphs
Meysam Alishahi, Hossein Hajiabolhassan, Frédéric Meunier
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number…
A Note on Altermatic Number
Meysam Alishahi, Hossein Hajiabolhassan
In view of Tucker's lemma (an equivalent combinatorial version of the Borsuk- Ulam theorem), the present authors (2013) introduced the kth altermatic number of a graph G as a tight…