9 research outputs found
On uniquely packable trees
An -packing in a graph is a set of vertices that are pairwise distance
more than apart. A \emph{packing colouring} of is a partition
of such that each colour class
is an -packing. The minimum order of a packing colouring is called the
packing chromatic number of , denoted by . In this paper we
investigate the existence of trees for which there is only one packing
colouring using colours. For the case , we
completely characterise all such trees. As a by-product we obtain sets of
uniquely --packable trees with monotone -coloring
and non-monotone -coloring respectively
A Liouville hyperbolic souvlaki
We construct a transient bounded-degree graph no transient subgraph of which embeds in any surface of finite genus. Moreover, we construct a transient, Liouville, bounded-degree, Gromov– hyperbolic graph with trivial hyperbolic boundary that has no transient subtree. This answers a question of Benjamini. This graph also yields a (further) counterexample to a conjecture of Benjamini and Schramm. In an appendix by G´abor Pete and Gourab Ray, our construction is extended to yield a unimodular graph with the above properties
Proceedings of the 1st International Conference on Algebras, Graphs and Ordered Sets (ALGOS 2020)
International audienceOriginating in arithmetics and logic, the theory of ordered sets is now a field of combinatorics that is intimately linked to graph theory, universal algebra and multiple-valued logic, and that has a wide range of classical applications such as formal calculus, classification, decision aid and social choice.This international conference “Algebras, graphs and ordered set” (ALGOS) brings together specialists in the theory of graphs, relational structures and ordered sets, topics that are omnipresent in artificial intelligence and in knowledge discovery, and with concrete applications in biomedical sciences, security, social networks and e-learning systems. One of the goals of this event is to provide a common ground for mathematicians and computer scientists to meet, to present their latest results, and to discuss original applications in related scientific fields. On this basis, we hope for fruitful exchanges that can motivate multidisciplinary projects.The first edition of ALgebras, Graphs and Ordered Sets (ALGOS 2020) has a particular motivation, namely, an opportunity to honour Maurice Pouzet on his 75th birthday! For this reason, we have particularly welcomed submissions in areas related to Maurice’s many scientific interests:• Lattices and ordered sets• Combinatorics and graph theory• Set theory and theory of relations• Universal algebra and multiple valued logic• Applications: formal calculus, knowledge discovery, biomedical sciences, decision aid and social choice, security, social networks, web semantics..
Some Problems in Algebraic and Extremal Graph Theory.
In this dissertation, we consider a wide range of problems in algebraic and extremal graph theory. In extremal graph theory, we will prove that the Tree Packing Conjecture is true for all sequences of trees that are \u27almost stars\u27; and we prove that the Erdos-Sos conjecture is true for all graphs G with girth at least 5. We also conjecture that every graph G with minimal degree k and girth at least contains every tree T of order such that This conjecture is trivially true for t = 1. We Prove the conjecture is true for t = 2 and that, for this value of t, the conjecture is best possible. We also provide supporting evidence for the conjecture for all other values of t. In algebraic graph theory, we are primarily concerned with isomorphism problems for vertex-transitive graphs, and with calculating automorphism groups of vertex-transitive graphs. We extend Babai\u27s characterization of the Cayley Isomorphism property for Cayley hypergraphs to non-Cayley hypergraphs, and then use this characterization to solve the isomorphism problem for every vertex-transitive graph of order pq, where p and q distinct primes. We also determine the automorphism groups of metacirculant graphs of order pq that are not circulant, allowing us to determine the nonabelian groups of order pq that are Burnside groups. Additionally, we generalize a classical result of Burnside stating that every transitive group G of prime degree p, is doubly transitive or contains a normal Sylow p-subgroup to all p\sp k, provided that the Sylow p-subgroup of G is one of a specified family. We believe that this result is the most significant contained in this dissertation. As a corollary of this result, one easily gives a new proof of Klin and Poschel\u27s result characterizing the automorphism groups of circulant graphs of order p\sp k, where p is an odd prime
Interactions between large-scale invariants in infinite graphs
This thesis is devoted to the study of a number of properties of graphs. Our first main result clarifies the relationship between hyperbolicity and non-amenability for plane graphs of bounded degree. This generalises a known result for Cayley graphs to bounded degree graphs. The second main result provides a counterexample to a conjecture of Benjamini asking whether a transient, hyperbolic graph must have a transient subtree. In Chapter 4 we endow the set of all graphs with two pseudometrics and we compare metric properties arising from each of them. The two remaining chapters deal with bi-infinite paths in Z² and geodetic Cayley graphs