The 2‐Blocking Number and the Upper Chromatic Number of PG(2,q)

A twofold blocking set (double blocking set) in a finite projective plane Π is a set of points, intersecting every line in at least two points. The minimum number of points in a double blocking set of Π is denoted by τ₂(Π). Let PG(2,q) be the Desarguesian projective plane over GF(q), the finite field of q elements. We show that if q is odd, not a prime, and r is the order of the largest proper subfield of GF(q), then τ₂PG(2,q))≤ 2(q+(q‐1)/(r‐1)). For a finite projective plane Π, let denote the maximum number of classes in a partition of the point‐set, such that each line has at least two points in some partition class. It can easily be seen that (?) for every plane Π on v points. Let , p prime. We prove that for , equality holds in (?) if q and p are large enough.     

Character tables and the problem of existence of finite projective planes

We use the connection between positive definite functions and the character table of the symmetric group S₆ to give a short new proof of the nonexistence of a finite projective plane of order 6. For higher orders, like 10 and 12, the method seems to be inconclusive as of now, but could be a basis of further research.     

Two-transitive orbits in finite projective planes

The problem of classifying finite projective planes of order n with an automorphism group G and a point orbit on which G acts two-transitively is investigated in considerable detail, under the assumption that has length at last n. Combining old and new results a rather satisfying classification is obtained, even though some cases for orbit lengths n and n + 1 remain unsolved.     

C‐perfect hypergraphs

Let ${\mathcal{H}}=({{X}},{\mathcal{E}})Let ${\mathcal{H}}=({{X}},{\mathcal{E}})$ be a hypergraph with vertex set X and edge set ${\mathcal{E}}$. A C‐coloring of ${\mathcal{H}}$ is a mapping ?:X→? such that |?(E)|<|E| holds for all edges ${{E}}\in{\mathcal{E}}$ (i.e. no edge is multicolored). We denote by $\bar{\chi}({\mathcal{H}})$ the maximum number |?(X)| of colors in a C‐coloring. Let further $\alpha({\mathcal{H}})$ denote the largest cardinality of a vertex set S?X that contains no ${{E}}\in{\mathcal{E}}$, and $\tau({\mathcal{H}})=|{{X}}|-\alpha({\mathcal{H}})$ the minimum cardinality of a vertex set meeting all $E \in {\mathcal{E}}$. The hypergraph ${\mathcal{H}}$ is called C‐perfect if $\bar{\chi}({\mathcal{H}}\prime)=\alpha({\mathcal{H}}\prime)$ holds for every induced subhypergraph ${\mathcal{H}}\prime\subseteq{\mathcal{H}}$. If ${\mathcal{H}}$ is not C‐perfect but all of its proper induced subhypergraphs are, then we say that it is minimally C‐imperfect. We prove that for all r, k∈? there exists a finite upper bound h(r, k) on the number of minimally C‐imperfect hypergraphs ${\mathcal{H}}$ with $\tau({\mathcal{H}})\le {{k}}$ and without edges of more than r vertices. We give a characterization of minimally C‐imperfect hypergraphs that have τ=2, which also characterizes implicitly the C‐perfect ones with τ=2. From this result we derive an infinite family of new constructions that are minimally C‐imperfect. A characterization of minimally C‐imperfect circular hypergraphs is presented, too. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 132–149, 2010     

About the upper chromatic number of a co-hypergraph

A mixed hypergraph consists of two families of subsets: the edges and the co-edges. In a coloring every co-edge has at least two vertices of the same color, and every edge has at least two vertices of different colors. The largest and smallest possible number of colors in a coloring is termed the upper and lower chromatic numbers, respectively. In this paper we investigate co-hypergraphs i.e., the hypergraphs with only co-edges, with respect to the property of coloring. The relationship between the lower bound of the size of co-edges and the lower bound of the upper chromatic number is explored. The necessary and sufficient conditions for determining the upper chromatic numbers, of a co-hypergraph are provided. And the bounds of the number of co-edges of some uniform co-hypergraphs with certain upper chromatic numbers are given.     

Orthogonal representations over finite fields and the chromatic number of graphs

We study the relationship between the minimum dimension of an orthogonal representation of a graph over a finite field and the chromatic number of its complement. It turns out that for some classes of matrices defined by a graph the 3-colorability problem is equivalent to deciding whether the class defined by the graph contains a matrix of rank 3 or not. This implies the NP-hardness of determining the minimum rank of a matrix in such a class. Finally we give for any class of matrices defined by a graph that is interesting in this respect a reduction of the 3-colorability problem to the problem of deciding whether or not this class contains a matrix of rank equal to three.The author is financially supported by the Cooperation Centre Tilburg and Eindhoven Universities.     

Edge‐face chromatic number and edge chromatic number of simple plane graphs

Given a simple plane graph G, an edge‐face k‐coloring of G is a function ? : E(G) ∪ F(G) → {1,…,k} such that, for any two adjacent or incident elements a, b ∈ E(G) ∪ F(G), ?(a) ≠ ?(b). Let χ_e(G), χ_ef(G), and Δ(G) denote the edge chromatic number, the edge‐face chromatic number, and the maximum degree of G, respectively. In this paper, we prove that χ_ef(G) = χ_e(G) = Δ(G) for any 2‐connected simple plane graph G with Δ (G) ≥ 24. © 2005 Wiley Periodicals, Inc. J Graph Theory     

A completion problem for finite affine planes

A partial affine plane (PAP) of ordern is ann ²-setS of points together with a collection ofn-subsets ofS called lines such that any two lines meet in at most one point. We obtain conditions under which a PAP with nearlyn ²+n lines can be completed to an affine plane by adding lines. In particular, we make use of Bruck’s completion condition for nets to show that certain PAP’s with at leastn ²+n−√n can be completed and that forn≠3 any PAP withn ²+n−2 lines can be completed.     

Circular mixed hypergraphs II:The upper chromatic number

A mixed hypergraph is a triple H=(X,C,D), where X is the vertex set and each of C, D is a family of subsets of X, the C-edges and D-edges, respectively. A proper k-coloring of H is a mapping c:X→[k] such that each C-edge has two vertices with a common color and each D-edge has two vertices with distinct colors. A mixed hypergraph H is called circular if there exists a host cycle on the vertex set X such that every edge (C- or D-) induces a connected subgraph of this cycle.We suggest a general procedure for coloring circular mixed hypergraphs and prove that if H is a reduced colorable circular mixed hypergraph with n vertices, upper chromatic number and sieve number s, then

     

图的邻点可区别全色数的一个上界

图G的一个正常全染色被称为邻点可区别全染色,如果G中任意两个相邻点的色集合不同．本文用概率方法得到了邻点可区别全色数的一个上界．     

On the upper chromatic number and multiple blocking sets of PG(n,q)

We investigate the upper chromatic number of the hypergraph formed by the points and the $k$‐dimensional subspaces of $\text{PG}\left(n,q\right)$; that is, the most number of colors that can be used to color the points so that every $k$‐subspace contains at least two points of the same color. Clearly, if one colors the points of a double blocking set with the same color, the rest of the points may get mutually distinct colors. This gives a trivial lower bound, and we prove that it is sharp in many cases. Due to this relation with double blocking sets, we also prove that for $t\le \frac{3}{8}p+1$, a small $t$‐fold (weighted) $\left(n?k\right)$‐blocking set of $\text{PG}\left(n,p\right),p$ prime, must contain the weighted sum of $t$ not necessarily distinct $\left(n?k\right)$‐spaces.     

The total chromatic number of regular graphs of high degree

The total chromatic number χT (G) of a graph G is the minimum number of colors needed to color the edges and the vertices of G so that incident or adjacent elements have distinct colors. We show that if G is a regular graph and d(G) 32 |V (G)| + 263 , where d(G) denotes the degree of a vertex in G, then χT (G) d(G) + 2.     

混合超图的染色理论

混合超图是含有两种超边的超图，一种称为D-超边，一种称为C-超边，它们的区别主要体现在染色要求上．混合超图的染色，要求每-D-超边至少有两个点染不同的颜色，每一C-超边至少有两个点染相同的颜色．用颜色最多的染色所用的颜色数称为该混合超图的上色数，用颜色最少的染色所用的颜色数称为该混合超图的下色数．混合超图的染色理论是目前国际组合学界比较新的研究课题之一．本文主要概括介绍关于混合超图染色理论已经取得的一些成果，其中包含本文作者的研究成果．并提出了一些可供进一步研究的问题．     

On the circular chromatic number of circular partitionable graphs

This article studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs G has . A consequence of this result is that we obtain an infinite family of graphs G with the rare property that the deletion of each vertex decreases its circular chromatic number by exactly 1. © 2006 Wiley Periodicals, Inc. J Graph Theory     

Cycles in graphs of uncountable chromatic number

We answer a question of Erdős [1], [2] by showing that any graph of uncountable chromatic number contains an edge through which there are cycles of all (but finitely many) lengths.     

The incidence game chromatic number of paths and subgraphs of wheels

The incidence game chromatic number was introduced to unify the ideas of the incidence coloring number and the game chromatic number. We determine the exact incidence game chromatic number of large paths and give a correct proof of a result stated by Andres [S.D. Andres, The incidence game chromatic number, Discrete Appl. Math. 157 (2009) 1980-1987] concerning the exact incidence game chromatic number of large wheels.     

Total chromatic number of one kind of join graphs

The total chromatic number χ_T(G) of a graph G is the minimum number of colors needed to color the elements (vertices and edges) of G such that no adjacent or incident pair of elements receive the same color. G is called Type 1 if χ_T(G)=Δ(G)+1. In this paper we prove that the join of a complete inequibipartite graph K_n1,n2 and a path P_m is of Type 1.     

The concentration of the chromatic number of random graphs

We prove that for every constant >0 the chromatic number of the random graphG(n, p) withp=n ^–1/2– is asymptotically almost surely concentrated in two consecutive values. This implies that for any <1/2 and any integer valued functionr(n)O(n ) there exists a functionp(n) such that the chromatic number ofG(n,p(n)) is preciselyr(n) asymptotically almost surely.Research supported in part by a USA Israeli BSF grant and by a grant from the Israel Science Foundation.Research supported in part by a Charles Clore Fellowship.