# Tagged Questions

**1**

vote

**0**answers

78 views

### Kempe chain color swaps in a partially colored map

Crossposted from math.stackexchange.com:
http://math.stackexchange.com/questions/904932/kempe-chain-color-swaps-in-a-partially-colored-map
Question: In this partially Tait's colored map, using ...

**5**

votes

**2**answers

228 views

### Matching number and chromatic number

If $G$ is a (finite) graph, denote with $\mu(G)$ the size of any maximum matching in $G$ (this number is also called the "matching number" of $G$).
For odd integers $n$ we have $n=\chi(K_n) = ...

**0**

votes

**0**answers

69 views

### asymptotic notation with graph colouring

This is my first ever post so I hope this is an appropriate question.
Basically I am looking at the paper here: http://homepages.math.uic.edu/~mubayi/papers/biclique.pdf
Namely theorem 5.
Now, feel ...

**6**

votes

**2**answers

198 views

### Conjecture: for perfect graphs the fractional chromatic index rounded up equals the chromatic index

Let $\chi'_f(G)$ be the fractional chromatic index.
Based on limited experiments (up to 8 vertices and few larger graphs),
I suspect:
Conjecture For perfect graphs $\lceil \chi'_f(G) \rceil = ...

**8**

votes

**1**answer

320 views

### Postnikov's approach to perfect matchings of graphs

Over a decade ago Alexander Postnikov developed his own way of looking at perfect matchings of bipartite plane graphs. As I recall, he starts with a 2-coloring of the square grid and creates a new ...

**6**

votes

**0**answers

128 views

### The Universal Labeling of graph

The universal labeling of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $\ell$ of $G$ for every two adjacent vertices $v$ and $u$, the sum of incoming edges of $v$ ...

**10**

votes

**2**answers

178 views

### Big Mono-Chromatic Subgraphs of Vertex 2-Colourings

I'm not a graph theorist, but the following quantity came up in my work and I'm curious if it has been studied. Given a connected finite graph $\Gamma = (V,E)$ define: $$ c(\Gamma) = \min_{f : V ...

**5**

votes

**1**answer

297 views

### Bipartite Graphs arising from two k-partitions of a given Graph

Let $G$ be an $n$-chromatic connected graph. Let $(V_1, V_2, \cdots, V_n)$ and $(U_1, U_2, \cdots, U_n)$ be two partitions of $V(G)$ corresponding to proper n-colorings of $G$.
Consider the bipartite ...

**2**

votes

**1**answer

181 views

### Coloring of subgraphs of G^n

Let $G=(L,R,E)$ be a finite bipartite graph, such that for each $v\in L\cup R: deg(v)>0$. Define $E^{(n)}=\{(\overline{l},\overline{r}) | \overline{l}=(l_1,...,l_n)\in L^n , ...

**3**

votes

**0**answers

73 views

### Size of b-matching constructed from b maximal matchings

The Question: Let $G$ be a (simple) graph and let $b\in\mathbb{N}$. Suppose that we have $b$ disjoint edge-subsets $M_1,\ldots , M_b$ satisfying the following condition: The set $M_1$ is a maximal ...

**6**

votes

**1**answer

232 views

### What is the status of this strong form of Hedetniemi's conjecture?

In this question, a graph is a finite, undirected graph without loops or multiple edges, and a colouring of a graph is a proper vertex colouring. The product $G \times H$ of graphs $G$ and $H$ is the ...

**16**

votes

**1**answer

629 views

### A Question on 1, 2 ,3 Conjecture

1, 2, 3 conjecture is well-known:
If $G$ is a simple graph which is not $K_2$ then one can assign a number among $1, 2, 3$ to every edge such that if we label each vertex with the sum of the numbers ...

**20**

votes

**3**answers

1k views

### Can one measure the infeasibility of four color proofs?

Terms like "impractical" and "unfeasible" are used to say the Robertson, Sanders, Seymour, and Thomas proof of the four color theorem needs computer assistance. Obviously no precise measure is ...

**5**

votes

**1**answer

257 views

### Minimal graphs of prescribed girth and chromatic number

The well known result of ErdÅ‘s, states that
Given integers $g > 2$ and $k > 1$ there exist a graph $G$ with $\chi(G) \geq k$ and girth at least $g.$
What I am wondering is
When can we ...

**5**

votes

**1**answer

191 views

### Probability that a random edge coloring of the complete graph is proper

This is a repost of this math.se question that I am posting here since it received no attention there.
What is the probability that a random edge coloring of $K_n$ with
$m \geq n$ colors ...

**5**

votes

**2**answers

244 views

### Fractional chromatic number, find reference to a particular alternate definition for

I'm searching for a reference to a particular alternate definition of the fractional chromatic number of graphs.
Let me review the most common definition and basic properties first.
Let $ G $ be ...

**4**

votes

**1**answer

442 views

### Vector chromatic number and Lovasz theta

For $\alpha \ge 2$, an $\alpha$-vector coloring of a graph $X$ is an assignment of unit vectors to the vertices of $X$ such that vectors assigned to adjacent vertices have inner product less than or ...

**8**

votes

**3**answers

409 views

### Edge-coloring of the complete graph without any rainbow paths

For a given $2k-1$ edge coloring of the complete graph $K_{2k}$,
say a Hamiltonian path $P$ is a rainbow path if every color appears exactly once in $P$.
My question is
"For each $2k (k \geq 2)$, is ...

**2**

votes

**2**answers

379 views

### Coloring a graph by Maximum Independent Set extraction

recursively extracting a MIS from an undirected simple graph $G$ does produce a minimal coloring for $G$ ?
I searched extensively the internet and found a paper [1] which answer partially to this ...

**2**

votes

**1**answer

201 views

### Isomorphism of connected, rigid, N-regular graphs with chromatic index N?

Background/Motivation
I'm working on algorithms for canonical labeling of a certain class of graphs (motivated by biology). The "difficult" instances of this problem can be reduced to graphs of the ...

**4**

votes

**1**answer

204 views

### 2-Coloring a planar hypergraph

Consider a hypergraph (of rank 3) $H = (V, E)$ (where the rank of $H$ is the maximum cardinality of a hyperedge). $H$ is said to be planar if we can construct a planar graph $G = (V, A)$, and a ...

**2**

votes

**1**answer

173 views

### A Ramsey-like lower bound?

Does there exist a graph $G$ which cannot be properly vertex-coloured with 3 colours (i.e. $G$ has chromatic number at least 4), such that for every graph $H$, if $H$ contains a triangle but there ...

**3**

votes

**1**answer

175 views

### What is the definition of a discharge rule?

This question is in the reverse direction of a common MO question. Instead of being faced with a formal definition and asking for some intuition for the definition, I have a concept with I understand ...

**5**

votes

**1**answer

254 views

### Edge Colorings of Directed Graphs which Respect an Involution

Let G be a graph and let C be a set of coloring. Suppose that there is an involution $\phi$ from C to C. We can think about the element of C as the nonzero elements of some Abelian group and ...

**7**

votes

**0**answers

227 views

### A maximum discrepancy hypergraph 2-colouring problem

This is sort of a hypergraph-ish question that I feel should be easy to prove or disprove but I can't see it right now.
The setup is as follows. We have a vertex set partitioned in to sets ...

**6**

votes

**5**answers

1k views

### Highly symmetric 6-regular graph with 20 vertices

I'm interested in (node/edge-)symmetric 6-regular graphs on 20 vertices and 60 edges, especially ones with a A5/icosahedral/dodecahedral symmetry group and especially their chromatic number. So far I ...

**5**

votes

**2**answers

465 views

### The Problem about 2-coloring finite plane

Suppose we color a $X \times X$ finite plane by red and blue arbitrarily. How large does X need to be to guarantee a monochromatic combinatorial square $k \times k$
1 0 1 0 1 1
1 1 1 1 1 1
1 ...

**24**

votes

**2**answers

682 views

### chromatic number of the hyperbolic plane

A notorious problem in combinatorics is the following:
If we color $\mathbb{R}^2$ so that no pair of points at unit distance get the same color, what is the fewest number of colors required?
This ...

**2**

votes

**0**answers

176 views

### Maximum number of 4-colorings of planar graphs (precise version)

This is a redo of my earlier question.
I'm trying again with more precision. I ignored one of the dicta in the "how to ask" page.
For a fixed $n$, what is known (references preferred) about the ...

**3**

votes

**3**answers

356 views

### Maximum number of different 4-colorings of planar graphs of a given size

I understand that it is computationally hard to count the 4-colorings of a given graph. See answers to
this question
In a given class of planar graphs (will leave choice of class open) is there a ...

**5**

votes

**1**answer

876 views

### Has anyone seen this graph?

I recently constructed the graph shown below in the process of investigating some problems regarding line graphs and homomorphisms, and then happened to see it on wikipedia. I was wondering if anyone ...

**3**

votes

**3**answers

325 views

### Can you prove that hypergraphs with n-1 edges are partially 2 colorable?

I can. But my proof uses a theorem (which I do not reveal yet to avoid influencing you) and it feels like an overkill, so I wonder if there is a simple proof. Now the problem.
Suppose we have a ...

**3**

votes

**5**answers

843 views

### How many “different” colorings (excluding exchanges) exist for a given map (graph)?

In particular I'm interested in regular maps, excluding all maps that can be colored with 2 or 3 colors.
For what I need to analyze, maps have to be regarded as differently colored, if the same ...

**4**

votes

**1**answer

902 views

### Simplest examples of unique-solution and unsolvable-without-backtracking Sudoku-like problems

A
The Sudoku game admits a broad generalization as follows : let $r$ be an integer $\geq 2$
and let $X$ be a finite set, and ${\cal X}$ be a collection of $r$-subsets of $X$
(i.e, a $r$-uniform ...

**4**

votes

**2**answers

574 views

### Coloring edges on a graph s.t. the set of edges for any two vertices have no more than 'k' colors in common

Please imagine the case where one has a planar graph, $G$, with a set of $|V|$ vertices, $(v_1, ..., v_{|V|}) \in V$, and $|E|$ edges, $(e_1, ..., e_{|E|}) \in E$. Now, provided a total of $N$ ...

**9**

votes

**2**answers

427 views

### Labelled spanning trees without edge crossings

Draw the complete graph $K_n$ on a plane in general position with every edge a straight line and randomly label the edges $0$ or $1$. Does this graph always have a spanning tree with no edges crossing ...

**8**

votes

**2**answers

503 views

### Derivative of Tutte polynomial at -1

Let Tutte polynomial on graph with edge-set $E$ be defined as follows
$$f(q,v)=\sum_{A\subseteq E} q^{\kappa(A)} v^{|A|}$$
Here the sum is over all subgraphs $A$, $\kappa(A)$ is the number of ...

**7**

votes

**1**answer

418 views

### Graphs with the same chromatic symmetric function

Does anyone know more examples of two nonisomorphic connected graphs with the same chromatic symmetric function? The only pair I know is the one in Stanley's paper on c.s.f.'s ...

**28**

votes

**0**answers

827 views

### Does every triangle-free graph with maximum degree at most 6 have a 5-colouring?

A very specific case of Reed's Conjecture
Reed's $\omega$,$\Delta$, $\chi$ conjecture proposes that every graph has $\chi \leq \lceil \tfrac 12(\Delta+1+\omega)\rceil$. Here $\chi$ is the chromatic ...

**4**

votes

**2**answers

473 views

### Tractably Partitioning the possible vertex k-colorings of a graph by local stability and instability.

A k-coloring or k-labeling of the vertices of a single-component undirected graph G with $n$ vertices can be a proper coloring or not. If it is not a proper coloring, such that each vertex has ...

**14**

votes

**6**answers

3k views

### Lower bounds for chromatic number of a graph

I am trying to find a good lower bound for chromatic number of one family of graphs. I'm curious what are the known lower bounds for chromatic number. There are two obvious: $\chi(G) \geq \omega(G)$ ...

**21**

votes

**12**answers

3k views

### Strengthening the Induction Hypothesis

Suppose you are trying to prove result $X$ by induction and are getting nowhere fast. One nice trick is to try to prove a stronger result $X'$ (that you don't really care about) by induction. This ...

**47**

votes

**8**answers

6k views

### The “sensitivity” of 2-colorings of the d-dimensional integer lattice

Consider the $d$-dimensional integer lattice, $Z^d$. Call two points in $Z^d$ "neighbors" if their Euclidean distance is 1 (i.e., if they differ by 1 on exactly one coordinate).
Let $C$ be a ...

**2**

votes

**2**answers

313 views

### Colourings of Graphs with extra conditions

As a phd-student I've wandered into a question of colourings of graphs and wondered what was known about them.
Given a finite graph G, where the maximum degree of a vertex is d, I'm interested in ...

**12**

votes

**6**answers

2k views

### A decision problem in graph coloring

It'll be great to get a pointer or answer to the following question:
What is the complexity of the following problem? Given an unweighted and undirected graph, can we have a proper (not necessarily ...

**9**

votes

**1**answer

610 views

### Finding Two Rainbow Spanning Trees

Suppose we have a graph whose edges are coloured. It's not necessarily a proper colouring: a given node may have 0, 1, or several incident edges of a given colour.
Is the following problem ...

**10**

votes

**2**answers

531 views

### Can we select a rainbow matching if each degree is 6 and each colorclass is a C_6?

Suppose that we have a 2d-regular graph whose edges are colored such that the edges of each color form a cycle of length 2d. (So if the graph has 2n vertices, then there are n colors.) Is it true that ...

**24**

votes

**3**answers

3k views

### Algebraic Proof of 4-Colour Theorem?

4-Colour Theorem. Every planar graph is 4-colourable.
This theorem of course has a well-known history. It was first proven by Appel and Haken in 1976, but their proof was met with skepticism ...

**15**

votes

**1**answer

1k views

### Making a non-monotone function monotone

Consider a function $f: \{0,1\}^n \rightarrow \{1..R\}$. This function can be interpreted as a coloring $Color(v)$ of vertices in a unit n-dimensional hypercube in $R$ colors.
We say there is a ...

**5**

votes

**4**answers

984 views

### Coloring Points in the Plane

Suppose one wants to color the points in the plane so any two points at distance one apart are different colors. How many colors are needed?
I heard this problem when I was a kid. Back then the most ...