in this paper, we examine that some simple $k_4$-groups can be determined uniquely by their orders and one or two irreducible complex character degrees.

Abstract We determine the maximum number of edges in a $$K_4$$ K 4 -minor-free n -vertex graph girth g , when $$g=5$$ g = 5 or is even. argue that there are many different extremal graphs if even ...

Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 30 November 2020Accepted: 26 July 2021Published online: 18 2021Keywordscounting modulo 2, counting complexity, graph homomorphisms, parity complexity dichotomyAMS Subject Headings68Q17, 68Q25Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society...