English
Related papers

Related papers: Cameron-Liebler sets in Hamming graphs

200 papers

Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.

Combinatorics · Mathematics 2014-01-07 L. Nguyen Van Thé

We study the set of all determinants of adjacency matrices of graphs with a given number of vertices.

Combinatorics · Mathematics 2009-08-25 Alireza Abdollahi

We give the classification of all possible G-graphs for any small binary dihedral subgroup G in GL(2,C) and use this classification to give the combinatorial description of the special representations of G in terms of its maximal cyclic…

Algebraic Geometry · Mathematics 2012-08-09 Álvaro Nolla de Celis

The aim of this paper is to develop the theory of Hom-coalgebras and related structures. After reviewing some key constructions and examples of quasi-deformations of Lie algebras involving twisted derivations and giving rise to the class of…

Rings and Algebras · Mathematics 2008-11-24 Abdenacer Makhlouf , Sergei Silvestrov

This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…

Combinatorics · Mathematics 2019-05-06 Will Grilliette , Lucas J. Rusnak

We introduce and study embeddings of graphs in finite projective planes, and present related results for some families of graphs including complete graphs and complete bipartite graphs. We also make connections between embeddings of graphs…

Combinatorics · Mathematics 2013-10-02 Keith Mellinger , Ryan Vaughn , Oscar Vega

In this paper, using Kronecker's theorem, we discuss the set of common fixed points of an n-parameter continuous semigroup of mappings. We also discuss convergence theorems to a common fixed point of an n-parameter nonexpansive semigroup.

Functional Analysis · Mathematics 2007-05-23 Tomonari Suzuki

In this work, we prove a general version of the reduction lemmas for eigenfunctions of graphs admitting involutive automorphisms of a special type.

Combinatorics · Mathematics 2023-05-23 Alexandr Valyuzhenich

We study various representations for cyclic lambda-terms as higher-order or as first-order term graphs. We focus on the relation between 'lambda-higher-order term graphs' (lambda-ho-term-graphs), which are first-order term graphs endowed…

Logic in Computer Science · Computer Science 2013-02-27 Clemens Grabmayer , Jan Rochel

We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. As an application of these results we can deduce a complete…

Combinatorics · Mathematics 2015-09-03 Mihyun Kang , Philipp Sprüssel

A locally checkable labeling problem (LCL) on a group $\Gamma$ asks one to find a labeling of the Cayley graph of $\Gamma$ satisfying a fixed, finite set of "local" constraints. Typical examples include proper coloring and perfect matching…

Logic · Mathematics 2026-01-28 Felix Weilacher

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

Group Theory · Mathematics 2019-02-28 Olga Varghese

We generalize the tree-confluent graphs to a broader class of graphs called Delta-confluent graphs. This class of graphs and distance-hereditary graphs, a well-known class of graphs, coincide. Some results about the visualization of…

Computational Geometry · Computer Science 2007-05-23 David Eppstein , Michael T. Goodrich , Jeremy Yu Meng

We consider various regular graphs defined on the set of elements of given rank of a finite polar space. It is likely that no two such graphs, of the same kind but defined for different ranks, can have the same degree. We shall prove this…

Combinatorics · Mathematics 2021-05-27 Antonio Pasini

Motivated by recent extensive studies on Wenger graphs, we introduce a new infinite class of bipartite graphs of the similar type, called linearized Wenger graphs. The spectrum, diameter and girth of these linearized Wenger graphs are…

Combinatorics · Mathematics 2014-12-02 Xiwang Cao , Mei Lu , Daqing Wan , Li-Ping Wang , Qiang Wang

In the paper, notions of relative separability for hypergraphs of models of a theory are defined. Properties of these notions and applications to ordered theories are studied: characterizations of relative separability both in a general…

Logic · Mathematics 2018-02-23 Beibut Kulpeshov , Sergey Sudoplatov

Recent work in hypergraph Ramsey theory has involved the introduction of a "lifting map" that associates a certain $3$-uniform hypergraph to a given graph, bounding cliques in a predictable way. In this paper, we interpret the lifting map…

Combinatorics · Mathematics 2020-12-29 Mark Budden , Josh Hiller , Tommy Meek , Andrew Penland

In this work, we try to enunciate the Total chromatic number of some Cayley graphs like the Cayley graph on Symmetric group, Alternating group, Dihedral group with respect to some generating sets and some other regular graphs.

Combinatorics · Mathematics 2023-07-04 Prajnanaswaroopa S

A relational structure is (connected-)homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions which generalise (connected-)homogeneity, where…

Combinatorics · Mathematics 2012-07-19 Deborah Lockett

The study of the homology of diagram algebras has emerged as an interesting and important field. In many cases, the homology of a diagram algebra can be identified with the homology of a group. In this paper we have two main aims. Firstly,…

Algebraic Topology · Mathematics 2024-12-20 Andrew Fisher , Daniel Graves