scholarly journals On the Quantum Chromatic Number of a Graph

10.37236/999 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Peter J. Cameron ◽  
Ashley Montanaro ◽  
Michael W. Newman ◽  
Simone Severini ◽  
Andreas Winter
Keyword(s):  
Chromatic Number ◽  
Random Graphs ◽  
First Principles ◽  
Clique Number ◽  
The Other ◽  
Quantum Model ◽  
Other Hand ◽  
Orthogonal Representations

We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a referee that they have a colouring of the graph.After discussing this notion from first principles, we go on to establish relations with the clique number and orthogonal representations of the graph. We also prove several general facts about this graph parameter and find large separations between the clique number and the quantum chromatic number by looking at random graphs. Finally, we show that there can be no separation between classical and quantum chromatic number if the latter is $2$, nor if it is $3$ in a restricted quantum model; on the other hand, we exhibit a graph on $18$ vertices and $44$ edges with chromatic number $5$ and quantum chromatic number $4$.

Dynamic Stability of Ni FCC Crystal under Isotropic Tension

2013 ◽  
Vol 592-593 ◽  
pp. 47-50
Author(s):  
Petr Řehák ◽  
Miroslav Černý
Keyword(s):  
Dynamic Stability ◽  
Wave Vector ◽  
First Principles ◽  
Lattice Dynamics ◽  
Harmonic Approximation ◽  
Tensile Loading ◽  
The Other ◽  
Other Hand ◽  
Critical Strains

Lattice dynamics and stability of fcc crystal of Ni under isotropic (hydrostatic) tensile loading are studied from first principles using supercell method and a harmonic approximation. According to the results, strength of the crystal is determined by occurrence of an instability related to soft phonons with finite wave vector. On the other hand, the critical strains and stresses associated with such instabilities are only slightly lower than those related to the volumetric instability.

Walking of Long Pipelines With Multiple Buckles: Can a Trend Be Trusted?

2018 ◽  
Author(s):  
Daniel Carneiro ◽  
Andrew Rathbone
Keyword(s):  
First Principles ◽  
Gradual Increase ◽  
Axial Displacement ◽  
The Other ◽  
Full Understanding ◽  
Other Hand ◽  
Operational Temperature ◽  
Number Of Cycles ◽  
Underlying Processes ◽  
Over Time

Walking of long pipelines with multiple buckles is usually self-limiting. The buckles break the ‘long’ pipeline into multiple ‘short’ ones that are prone to walk. However, as temperature decays over the length of the pipeline, the ‘short’ sections further downstream might become cyclically constrained and eventually anchor the full pipeline length. Walking of the hot end would then slow down and cease. This tapering down can take a large number of cycles, and not seem obvious when after a fair number of cycles, a small value of accumulated axial displacement per cycle is still observed in FEA. Often, designers would stop the analyses at some stage and assume the small rate will continue indefinitely. This can be overconservative, as a limit will often exist — which is demonstrated using first principles in the paper. On the other hand, extrapolating without full understanding of the underlying processes can be dangerous. For some particular conditions, the trend can suddenly change after continuing unaltered for many cycles. This paper illustrates such change in behavior with the example of a fictitious pipeline seeing a gentle, gradual increase in operational temperature over time. The exercise shows that, after the trend has apparently settled, at a given point the rate of walking can increase again. The conditions that trigger it are shown to be predictable.

scholarly journals Between 2- and 3-Colorability

10.37236/4673 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Alan Frieze ◽  
Wesley Pegden
Keyword(s):  
Positive Integer ◽  
Random Graphs ◽  
The Other ◽  
Chromatic Numbers ◽  
Other Hand ◽  
Odd Cycles

We consider the question of the existence of homomorphisms between $G_{n,p}$ and odd cycles when $p=c/n$, $1<c\leq 4$. We show that for any positive integer $\ell$, there exists $\epsilon=\epsilon(\ell)$ such that if $c=1+\epsilon$ then w.h.p. $G_{n,p}$ has a homomorphism from $G_{n,p}$ to $C_{2\ell+1}$ so long as its odd-girth is at least $2\ell+1$. On the other hand, we show that if $c=4$ then w.h.p. there is no homomorphism from $G_{n,p}$ to $C_5$. Note that in our range of interest, $\chi(G_{n,p})=3$ w.h.p., implying that there is a homomorphism from $G_{n,p}$ to $C_3$.  These results imply the existence of random graphs with circular chromatic numbers $\chi_c$ satisfying $2<\chi_c(G)<2+\delta$ for arbitrarily small $\delta$, and also that $2.5\leq \chi_c(G_{n,\frac 4 n})<3$ w.h.p.

scholarly journals A Note on Sparse Random Graphs and Cover Graphs

10.37236/1497 ◽  
2000 ◽  
Vol 7 (1) ◽  
Author(s):  
Tom Bohman ◽  
Alan Frieze ◽  
Miklós Ruszinkó ◽  
Lubos Thoma
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
High Probability ◽  
The Other ◽  
Other Hand ◽  
Cover Graph

It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph $G_{n,p}$ with $p\le \kappa \log n/n$ for any constant $\kappa < 2/3$. On the other hand, this is not true for somewhat higher densities: If $p\ge \lambda (\log n)^3 / (n\log\log n)$ with $\lambda > 1/8$ then with high probability we need to delete more edges than one from every triangle. Our result has a natural algorithmic interpretation.

scholarly journals The Non-Crossing Graph

10.37236/1140 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Nathan Linial ◽  
Michael Saks ◽  
David Statter
Keyword(s):  
Chromatic Number ◽  
Independence Number ◽  
Clique Number ◽  
The Other ◽  
Fractional Chromatic Number ◽  
Vertex Set

Two sets are non-crossing if they are disjoint or one contains the other. The non-crossing graph ${\rm NC}_n$ is the graph whose vertex set is the set of nonempty subsets of $[n]=\{1,\ldots,n\}$ with an edge between any two non-crossing sets. Various facts, some new and some already known, concerning the chromatic number, fractional chromatic number, independence number, clique number and clique cover number of this graph are presented. For the chromatic number of this graph we show: $$ n(\log_e n -\Theta(1)) \le \chi({\rm NC}_n) \le n (\lceil\log_2 n\rceil-1). $$

scholarly journals List Coloring Hypergraphs

10.37236/401 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Penny Haxell ◽  
Jacques Verstraete
Keyword(s):  
Chromatic Number ◽  
The Other ◽  
List Coloring ◽  
Other Hand ◽  
List Chromatic Number ◽  
Linear Hypergraphs ◽  
Linear Hypergraph

Let $H$ be a hypergraph and let $L_v : v \in V(H)$ be sets; we refer to these sets as lists and their elements as colors. A list coloring of $H$ is an assignment of a color from $L_v$ to each $v \in V(H)$ in such a way that every edge of $H$ contains a pair of vertices of different colors. The hypergraph $H$ is $k$-list-colorable if it has a list coloring from any collection of lists of size $k$. The list chromatic number of $H$ is the minimum $k$ such that $H$ is $k$-list-colorable. In this paper we prove that every $d$-regular three-uniform linear hypergraph has list chromatic number at least $(\frac{\log d}{5\log \log d})^{1/2}$ provided $d$ is large enough. On the other hand there exist $d$-regular three-uniform linear hypergraphs with list chromatic number at most $\log_3 d+3$. This leaves the question open as to the existence of such hypergraphs with list chromatic number $o(\log d)$ as $d \rightarrow \infty$.

scholarly journals The structure and the list 3-dynamic coloring of outer-1-planar graphs

2021 ◽  
Vol vol. 23, no. 3 (Graph Theory) ◽  
Author(s):  
Yan Li ◽  
Xin Zhang
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Upper Bound ◽  
Local Structure ◽  
Planar Graphs ◽  
Minimum Degree ◽  
Outer Region ◽  
The Other ◽  
Structural Theorem ◽  
Other Hand

An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of another sixteen configurations. There are two interesting applications of this structural theorem. First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp. 7), and this upper bound is sharp. On the other hand, we show that the list 3-dynamic chromatic number of every outer-1-planar graph is at most 6, and this upper bound is best possible.

scholarly journals The Size of Edge-critical Uniquely 3-Colorable Planar Graphs

10.37236/3228 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Naoki Matsumoto
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Upper Bound ◽  
Planar Graphs ◽  
Infinite Family ◽  
The Other ◽  
Other Hand ◽  
Colorable Graph

A graph $G$ is uniquely $k$-colorable if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. A uniquely $k$-colorable graph $G$ is edge-critical if $G-e$ is not a uniquely $k$-colorable graph for any edge $e\in E(G)$. In this paper, we prove that if $G$ is an edge-critical uniquely $3$-colorable planar graph, then $|E(G)|\leq \frac{8}{3}|V(G)|-\frac{17}{3}$. On the other hand, there exists an infinite family of edge-critical uniquely 3-colorable planar graphs with $n$ vertices and $\frac{9}{4}n-6$ edges. Our result gives a first non-trivial upper bound for $|E(G)|$.

Clustering feature of metal atoms in pentacene molecular solids: first-principles study

2021 ◽  
Author(s):  
Shunta Watanabe ◽  
Yoko Tomita ◽  
Kohei Kawabata ◽  
Takashi NAKAYAMA
Keyword(s):  
Metal Atom ◽  
First Principles ◽  
The Other ◽  
Molecular Devices ◽  
Molecular Solids ◽  
First Principles Calculations ◽  
First Principles Study ◽  
Metal Atoms ◽  
Other Hand ◽  
Impurity Metal

Abstract Metal-atom contamination often induces the degradation of organic molecular devices. In this work, we studied clustering feature of Au and Al impurity metal atoms in pentacene solids by the first-principles calculations. We found that Au atoms prefer to produce clusters in a molecule-edge space due to the strong bonding among Au atoms, and such clusters can increase their sizes by producing molecule vacancies. On the other hand, Al atom prefers to locate separately around the center of pentacene molecules due to the strong bonding between Al atom and surrounding molecules, which produces the scattering distribution of Al atoms in pentacene solids.

On the Relation between the Theories of Compound Interest and Life Contingencies

1907 ◽  
Vol 41 (3) ◽  
pp. 305-348
Author(s):  
John Mayhew Allen
Keyword(s):  
First Principles ◽  
The Other ◽  
General Aspect ◽  
Integral Calculus ◽  
Infinitesimal Calculus ◽  
General Hypothesis ◽  
Other Hand ◽  
Logical Sequence ◽  
The One ◽  
Compound Interest

It has often occurred to me that but scant justice has been done to the application of the infinitesimal calculus to the theories of compound interest and life contingencies. This is, perhaps, in some measure due to the popular relegation of the differential and integral calculus to the realms of the so-called “higher mathematics.” There are, of course, two aspects of the case to be borne in mind. On the one hand, it is necessary to present the subjects in such a form as will be best suited to the student who is commencing to study them. For this purpose experience shows that a start should be made with particular cases, leaving the generalization until such time as the student shall have obtained a grasp of first principles sufficient to enable him to view the subjects in their general aspect. On the other hand, however, there is no doubt that to the reflective mind there comes a time when the desire is felt to invert the process and deduce the formulæ in their logical sequence from a fundamental general hypothesis.

Sign in / Sign up

Export Citation Format

Share Document