### 数学代写|图论作业代写Graph Theory代考|MAT 6495

statistics-lab™ 为您的留学生涯保驾护航 在代写图论Graph Theory方面已经树立了自己的口碑, 保证靠谱, 高质且原创的统计Statistics代写服务。我们的专家在代写图论Graph Theory代写方面经验极为丰富，各种代写图论Graph Theory相关的作业也就用不着说。

• Statistical Inference 统计推断
• Statistical Computing 统计计算
• (Generalized) Linear Models 广义线性模型
• Statistical Machine Learning 统计机器学习
• Longitudinal Data Analysis 纵向数据分析
• Foundations of Data Science 数据科学基础

## 数学代写|图论作业代写Graph Theory代考|Local Kakeya Sets

Let $\mathbb{F}$ be a finite field containing $q$ elements and for $n \geq 1$ let $\mathbb{F}^{n}$ be the set of all $n$-tuple vectors with entries belonging to $\mathbb{F}$.

We say that a set $\mathcal{K} \subseteq \mathbb{F}^{n}$ is a Kakeya set with respect to the vector $\mathbf{x}=$ $\left(x_{1}, \ldots, x_{n}\right) \in \mathbb{F}^{n}$ if there exists $\mathbf{y}=\mathbf{y}(\mathbf{x}) \in \mathbb{F}^{n}$ such that the line
$$L(\mathbf{x}, \mathbf{y}):=\bigcup_{a \in \mathbb{F}}{\mathbf{y}+a \cdot \mathbf{x}} \subseteq \mathcal{K},$$
where $a \cdot \mathbf{x}:=\left(a x_{1}, \ldots, a x_{n}\right)$. For a set $\mathcal{T} \subseteq \mathbb{F}^{n}$, we say that $\mathcal{K} \subseteq \mathbb{F}^{n}$ is a Kakeya set with respect to $\mathcal{T}$ if $\mathcal{K}$ is a Kakeya set with respect to every vector $\mathbf{x} \in \mathcal{T}$. The following result describes the minimum size of local Kakeya sets.

Theorem 1. Let $\mathcal{T} \subseteq \mathbb{F}^{n}$ be any set with cardinality $# \mathcal{T}$ an integer multiple of $q-1$ and let $\theta(\mathcal{T})$ be the minimum size of a Kakeya set with respect to $\mathcal{T}$. We then have that
$$q \sqrt{M}+\min (0, q-\sqrt{M}) \leq \theta(\mathcal{T}) \leq q+q^{n}\left(1-\left(1-\frac{1}{q^{n-1}}\right)^{M-1}\right)$$
where $M:=\frac{# \mathcal{T}}{q-1}$.
For example suppose $M=\epsilon \cdot\left(\frac{q^{n}-1}{q-1}\right)$ for some $0<\epsilon \leq 1$. From the lower bound in ( $2.2)$, we then get that $\theta(T)$ grows at least of the order of $q^{n / 2}$. Similarly, using the fact that $1-x \geq e^{-x-x^{2}}$ for $0<x \leq \frac{1}{2}$, we get that
$$\left(1-\frac{1}{q^{n-1}}\right)^{M-1} \geq \exp \left(-\frac{M-1}{q^{n-1}}\left(1+\frac{1}{q^{n-1}}\right)\right) \geq e^{-\Delta}$$
where $\Delta:=\frac{q \epsilon}{q-1}\left(1+\frac{1}{q^{n-1}}\right)$. From (2.2) we then get that
$$\theta(\mathcal{T}) \leq q+q^{n}\left(1-e^{-\Delta}\right)$$
In what follows we prove the lower bound and the upper bound in Theorem 1 in that order.

## 数学代写|图论作业代写Graph Theory代考|Related Work

Acyclic coloring was also introduced in 1973 by Grünbaum [10] who proved that a graph with maximum degree 3 has an acyclic coloring with 4 colors.

The following bounds obtained in [3] are the best available asymptotic bounds for the acyclic chromatic number, that are obtained using the probabilistic method.
$$\Omega\left(\frac{d^{\frac{4}{3}}}{(\log d)^{\frac{1}{3}}}\right)=a(G)=O\left(d^{\frac{4}{3}}\right)$$
Recently, there have been some improvements in the constant factor of the upper bound in $[6,9,16]$, by using the entropy compression method. Similar results for the star chromatic number of graphs are obtained in [8], showing $\chi_{s}(G) \leq$ $\left\lceil 20 d^{3 / 2}\right\rceil$ for any graph $G$ with maximum degree $d$.

We observe that the method in [6] is also used in finding a general upper bound for $P_{k}$-coloring of graphs, when $k$ is even. This coloring is called star $k$ coloring, where a proper coloring of the vertices is obtained avoiding a bicolored $P_{2 k}$. In $[6]$, it is shown that every graph with maximum degree $\Delta$ has a star $k$ coloring with at most $c_{k} k^{\frac{1}{k-1}} \Delta^{\frac{2 k-1}{2 k-2}}+\Delta$ colors, where $c_{k}$ is a function of $k$. Our result presented in Sect. 2 improves this result and generalizes Fertin et al.’s result in $[8]$ to $\bar{P}_{k}$-coloring of graphs for $k \geq 4$.

The star chromatic number and acyclic chromatic number of products of graphs have been studied widely as well. In [8], various bounds on the star chromatic number of some graph families such as hypercube, grid, tori are obtained,providing exact values for 2-dimensional grids, trees, complete bipartite graphs, cycles, outerplanar graphs. More recent results on the acyclic coloring of grid and tori can be found in [1] and [11]. Similarly, the acyclic chromatic number of the grid and hypercube is studied in [7]. Moreover, $[12-14]$ investigate the acyclic chromatic number for products of trees, products of cycles and Hamming graphs. For some graphs, finding the exact values of these chromatic numbers has been a longstanding problem, such as the hypercube.

## 数学代写|图论作业代写Graph Theory代考|Local Kakeya Sets

$$L(\mathbf{x}, \mathbf{y}):=\bigcup_{a \in \mathbb{F}} \mathbf{y}+a \cdot \mathbf{x} \subseteq \mathcal{K}$$

$$q \sqrt{M}+\min (0, q-\sqrt{M}) \leq \theta(\mathcal{T}) \leq q+q^{n}\left(1-\left(1-\frac{1}{q^{n-1}}\right)^{M-1}\right)$$

$$\left(1-\frac{1}{q^{n-1}}\right)^{M-1} \geq \exp \left(-\frac{M-1}{q^{n-1}}\left(1+\frac{1}{q^{n-1}}\right)\right) \geq e^{-\Delta}$$

$$\theta(\mathcal{T}) \leq q+q^{n}\left(1-e^{-\Delta}\right)$$

## 数学代写|图论作业代写Graph Theory代考|Related Work

Grünbaum [10] 在 1973 年也引入了非循环着色，他证明了最大度数为 3 的图具有 4 种颜色的非循环着色。

$$\Omega\left(\frac{d^{\frac{4}{3}}}{(\log d)^{\frac{1}{3}}}\right)=a(G)=O\left(d^{\frac{4}{3}}\right)$$

$[12-14]$ 研究树乘积、循环乘积和汉明图的无环色数。对于某些图表，找到这些色数的确切值一直是一个长期 存在的问题，例如超立方体。

﻿

﻿

﻿

## 有限元方法代写

tatistics-lab作为专业的留学生服务机构，多年来已为美国、英国、加拿大、澳洲等留学热门地的学生提供专业的学术服务，包括但不限于Essay代写，Assignment代写，Dissertation代写，Report代写，小组作业代写，Proposal代写，Paper代写，Presentation代写，计算机作业代写，论文修改和润色，网课代做，exam代考等等。写作范围涵盖高中，本科，研究生等海外留学全阶段，辐射金融，经济学，会计学，审计学，管理学等全球99%专业科目。写作团队既有专业英语母语作者，也有海外名校硕博留学生，每位写作老师都拥有过硬的语言能力，专业的学科背景和学术写作经验。我们承诺100%原创，100%专业，100%准时，100%满意。

﻿

## MATLAB代写

MATLAB 是一种用于技术计算的高性能语言。它将计算、可视化和编程集成在一个易于使用的环境中，其中问题和解决方案以熟悉的数学符号表示。典型用途包括：数学和计算算法开发建模、仿真和原型制作数据分析、探索和可视化科学和工程图形应用程序开发，包括图形用户界面构建MATLAB 是一个交互式系统，其基本数据元素是一个不需要维度的数组。这使您可以解决许多技术计算问题，尤其是那些具有矩阵和向量公式的问题，而只需用 C 或 Fortran 等标量非交互式语言编写程序所需的时间的一小部分。MATLAB 名称代表矩阵实验室。MATLAB 最初的编写目的是提供对由 LINPACK 和 EISPACK 项目开发的矩阵软件的轻松访问，这两个项目共同代表了矩阵计算软件的最新技术。MATLAB 经过多年的发展，得到了许多用户的投入。在大学环境中，它是数学、工程和科学入门和高级课程的标准教学工具。在工业领域，MATLAB 是高效研究、开发和分析的首选工具。MATLAB 具有一系列称为工具箱的特定于应用程序的解决方案。对于大多数 MATLAB 用户来说非常重要，工具箱允许您学习应用专业技术。工具箱是 MATLAB 函数（M 文件）的综合集合，可扩展 MATLAB 环境以解决特定类别的问题。可用工具箱的领域包括信号处理、控制系统、神经网络、模糊逻辑、小波、仿真等。

﻿

﻿

﻿

﻿

## AIOSEO設定

• 文章
• 区块

6个区块514字打开发布面板

• 文章

The graphs above are incomplete. These figures only show a vertex with degree four (vertex E), its nearest neighbors (A, B, C, and D), and segments of A-C Kempe chains. The entire graphs would also contain several other vertices (especially, more colored the same as B or D) and enough edges to be MPG’s. The left figure has A connected to $C$ in a single section of an A-C Kempe chain (meaning that the vertices of this chain are colored the same as A and C). The left figure shows that this A-C Kempe chain prevents B from connecting to $\mathrm{D}$ with a single section of a B-D Kempe chain. The middle figure has A and C in separate sections of A-C Kempe chains. In this case, B could connect to D with a single section of a B-D Kempe chain. However, since the A and C of the vertex with degree four lie on separate sections, the color of C’s chain can be reversed so that in the vertex with degree four, C is effectively recolored to match A’s color, as shown in the right figure. Similarly, D’s section could be reversed in the left figure so that D is effectively recolored to match B’s color.

Kempe also attempted to demonstrate that vertices with degree five are fourcolorable in his attempt to prove the four-color theorem [Ref. 2], but his argument for vertices with degree five was shown by Heawood in 1890 to be insufficient [Ref. 3]. Let’s explore what happens if we attempt to apply our reasoning for vertices with degree four to a vertex with degree five.

## 数学代写|图论作业代写Graph Theory代考|The previous diagrams

The previous diagrams show that when the two color reversals are performed one at a time in the crossed-chain graph, the first color reversal may break the other chain, allowing the second color reversal to affect the colors of one of F’s neighbors. When we performed the $2-4$ reversal to change B from 2 to 4 , this broke the 1-4 chain. When we then performed the 2-3 reversal to change E from 3, this caused C to change from 3 to 2 . As a result, F remains connected to four different colors; this wasn’t reversed to three as expected.
Unfortunately, you can’t perform both reversals “at the same time” for the following reason. Let’s attempt to perform both reversals “at the same time.” In this crossed-chain diagram, when we swap 2 and 4 on B’s side of the 1-3 chain, one of the 4’s in the 1-4 chain may change into a 2, and when we swap 2 and 3 on E’s side of the 1-4 chain, one of the 3’s in the 1-3 chain may change into a 2 . This is shown in the following figure: one 2 in each chain is shaded gray. Recall that these figures are incomplete; they focus on one vertex (F), its neighbors (A thru E), and Kempe chains. Other vertices and edges are not shown.

Note how one of the 3’s changed into 2 on the left. This can happen when we reverse $\mathrm{C}$ and $\mathrm{E}$ (which were originally 3 and 2 ) on E’s side of the 1-4 chain. Note also how one of the 4’s changed into 2 on the right. This can happen when we reverse B and D (which were originally 2 and 4) outside of the 1-3 chain. Now we see where a problem can occur when attempting to swap the colors of two chains at the same time. If these two 2’s happen to be connected by an edge like the dashed edge shown above, if we perform the double reversal at the same time, this causes two vertices of the same color to share an edge, which isn’t allowed. We’ll revisit Kempe’s strategy for coloring a vertex with degree five in Chapter $25 .$

## 数学代写|图论作业代写Graph Theory代考|The shading of one section of the B-R

• MPG 是三角测量的。它由具有三个边和三个顶点的面组成。
• 每个面的三个顶点必须是三种不同的颜色。
• 每条边由两个相邻的三角形共享，形成一个四边形。
• 每个四边形将有 3 或 4 种不同的颜色。如果与共享边相对的两个顶点恰好是相同的颜色，则它有 3 种颜色。
• 对于每个四边形，四个顶点中的至少 1 个顶点和最多 3 个顶点具有任何颜色对的颜色。例如，具有 R、G、B 和G有 1 个顶点R−是和3个顶点乙−G，或者您可以将其视为 1 个顶点乙−是和3个顶点G−R，或者您可以将其视为 BR 的 2 个顶点和 GY 的 2 个顶点。在后一种情况下，2G’ 不是同一链的连续颜色。
• 当您将更多三角形组合在一起（四边形仅组合两个）并考虑可能的颜色时，您将看到 Kempe 的部分

• 画一张R顶点和一个是由边连接的顶点。
• 如果一个新顶点连接到这些顶点中的每一个，它必须是乙或者G.
• 如果一个新顶点连接到 R 而不是是，可能是是,乙， 或者G.
• 如果一个新的顶点连接到是但不是R，可能是R,乙， 或者G.
• RY 链要么继续增长，要么被 B 包围，G.
• 如果你关注 B 和 G，你会为它的链条得出类似的结论。
• 如果一条链条完全被其对应物包围，则链条的新部分可能会出现在其对应物的另一侧。
Kempe 证明了所有具有四阶的顶点（那些恰好连接到其他四个顶点的顶点）都是四色的 [Ref. 2]。例如，考虑下面的中心顶点。

## 数学代写|图论作业代写Graph Theory代考|In the previous figure

• A 和 C 或者是 AC Kempe 链的同一部分的一部分，或者它们各自位于 AC Kempe 链的不同部分。（如果一种和C例如，是红色和黄色的，则 AC 链是红黄色链。） – 如果一种和C每个位于 AC Kempe 链的不同部分，其中一个部分的颜色可以反转，这有效地重新着色 C 以匹配 A 的颜色。如果 A 和 C 是 AC Kempe 链的同一部分的一部分，则 B 和 D每个都必须位于 BD Kempe 链的不同部分，因为 AC Kempe 链将阻止任何 BD Kempe 链从 B 到达 D。（如果乙和D是蓝色和绿色，例如，那么一种BD Kempe 链是蓝绿色链。）在这种情况下，由于 B 和 D 分别位于 BD Kempe 链的不同部分，因此 BD Kempe 链的其中一个部分的颜色可以反转，这有效地重新着色 D 以匹配 B颜色。– 因此，可以使 C 与 A 具有相同的颜色或使 D 具有与 A 相同的颜色乙通过反转 Kempe 链的分离部分。

Kempe 还试图证明五阶顶点是可四色的，以证明四色定理 [Ref. 2]，但 Heawood 在 1890 年证明他关于五次顶点的论点是不充分的 [Ref. 3]。让我们探讨一下如果我们尝试将我们对度数为四的顶点的推理应用于度数为五的顶点会发生什么。

## 有限元方法代写

tatistics-lab作为专业的留学生服务机构，多年来已为美国、英国、加拿大、澳洲等留学热门地的学生提供专业的学术服务，包括但不限于Essay代写，Assignment代写，Dissertation代写，Report代写，小组作业代写，Proposal代写，Paper代写，Presentation代写，计算机作业代写，论文修改和润色，网课代做，exam代考等等。写作范围涵盖高中，本科，研究生等海外留学全阶段，辐射金融，经济学，会计学，审计学，管理学等全球99%专业科目。写作团队既有专业英语母语作者，也有海外名校硕博留学生，每位写作老师都拥有过硬的语言能力，专业的学科背景和学术写作经验。我们承诺100%原创，100%专业，100%准时，100%满意。

## MATLAB代写

MATLAB 是一种用于技术计算的高性能语言。它将计算、可视化和编程集成在一个易于使用的环境中，其中问题和解决方案以熟悉的数学符号表示。典型用途包括：数学和计算算法开发建模、仿真和原型制作数据分析、探索和可视化科学和工程图形应用程序开发，包括图形用户界面构建MATLAB 是一个交互式系统，其基本数据元素是一个不需要维度的数组。这使您可以解决许多技术计算问题，尤其是那些具有矩阵和向量公式的问题，而只需用 C 或 Fortran 等标量非交互式语言编写程序所需的时间的一小部分。MATLAB 名称代表矩阵实验室。MATLAB 最初的编写目的是提供对由 LINPACK 和 EISPACK 项目开发的矩阵软件的轻松访问，这两个项目共同代表了矩阵计算软件的最新技术。MATLAB 经过多年的发展，得到了许多用户的投入。在大学环境中，它是数学、工程和科学入门和高级课程的标准教学工具。在工业领域，MATLAB 是高效研究、开发和分析的首选工具。MATLAB 具有一系列称为工具箱的特定于应用程序的解决方案。对于大多数 MATLAB 用户来说非常重要，工具箱允许您学习应用专业技术。工具箱是 MATLAB 函数（M 文件）的综合集合，可扩展 MATLAB 环境以解决特定类别的问题。可用工具箱的领域包括信号处理、控制系统、神经网络、模糊逻辑、小波、仿真等。