Search Results for author:
Found 4 papers, 0 papers with code
A systematic approach to random data augmentation on graph neural networks
On the theoretical side, among other results, we formally prove that under natural conditions all instantiations of our framework are universal.
Resolution with Symmetry Rule applied to Linear Equations
This paper considers the length of resolution proofs when using Krishnamurthy's classic symmetry rules.
Computational Complexity Discrete Mathematics F.2.2
Automorphism groups of graphs of bounded Hadwiger number
The first one states that the order of non-alternating, non-abelian composition factors for automorphism groups of graphs of bounded Hadwiger number is bounded.
Combinatorics Discrete Mathematics Group Theory 05C75, 05C83, 20D60
Classification of Finite Highly Regular Vertex-Coloured Graphs
A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism.
Combinatorics 05C60, 05B20, 05B05, 05C75
