Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 9 of 9 for “"Colourings"”.
-
Colourings, dominating sets and wreaths
… Chapter $4$ is about an ``odd'' variant of graph colourings. A proper colouring $\varphi$ of a graph $G$ is an \emph{odd colouring} if for every non-isolated vertex $v \in V(G)$ there is a colour $c$ such that $|N(v)\cap \varphi^{-1}(c)|$ is odd. The \emph{odd chromatic number} of $G$ is the …
-
Problems of optimal choice on posets and generalizations of acyclic colourings
… 4, I shall describe the history of acyclic colourings, in which a graph must be properly coloured with no two-coloured cycle, and state some results known about them and their variants. In particular, I shall highlight a result of Alon, McDiarmid and Reed, which bounds the acyclic chromatic …
-
Tilings and other combinatorial results
… subset of $P$. P\'or and Wood considered colourings of finite $P$ without large lines with a bounded number of colours. In particular, they examined whether monochromatic lines always appear in such colourings provided that $|P|$ is large. They conjectured that for all $k,l \ge 2$ there …
-
Quantum information, Bell inequalities and the no-signalling principle
… θ. The predictions of LHVT correspond to binary colourings of the Bloch sphere with antipodal points oppositely coloured. We show a Bell inequality for all θ, which generalizes the CHSH and the Braunstein-Caves inequalities in the sense that the measurement choices are not restricted to be in a …
-
Extremal Theory of Graph Minors and Related Topics
… transversal. Finally, Chapter 8 considers Gallai colourings, and more concretely which sequences of colour class sizes can be realized in a Gallai colouring. We prove a new restriction on such sequences, as well as two results showing certain sequences can be realized in this fashion.
-
Graph designs
La tesi contiene risultati originali su immersioni, colorazioni e metamorfosi di Graph Designs e una applicazione alle reti.
-
Extremal, Probabilistic, and Infinitary Problems in Combinatorics
… with bounded maximum degree and balanced 2-edge-colourings c of a host graph G with minimum degree at least (1 − ε)n for some ε > 0, we show that, for any sufficiently large n and sufficiently small ε, there exists a copy of H where the number of edges in the two colours differ by at most 2. …