Graphs and Combinatorics最新文献

The DP-coloring is a generalization of the list coloring, introduced by Dvořák and Postle. Let ({mathcal {H}}=(L,H)) be a cover of a graph G and (P_{DP}(G,{mathcal {H}})) be the number of ({mathcal {H}})-colorings of G. The DP color function (P_{DP}(G,m)) of G, introduced by Kaul and Mudrock, is the minimum value of (P_{DP}(G,{mathcal {H}})) where the minimum is taken over all possible m-fold covers ({mathcal {H}}) of G. For the family of n-vertex connected graphs, one can deduce that trees maximize the DP color function, from two results of Kaul and Mudrock. In this paper we obtain tight upper bounds for the DP color function of n-vertex 2-connected graphs. Another concern in this paper is the canonical labeling in a cover. It is well known that if an m-fold cover ({mathcal {H}}) of a graph G has a canonical labeling, then (P_{DP}(G,{mathcal {H}})=P(G,m)) in which P(G, m) is the chromatic polynomial of G. However the converse statement of this conclusion is not always true. We give examples that for some m and G, there exists an m-fold cover ({mathcal {H}}) of G such that (P_{DP}(G,{mathcal {H}})=P(G,m)), but ({mathcal {H}}) has no canonical labelings. We also prove that when G is a unicyclic graph or a theta graph, for each (mge 3), if (P_{DP}(G,{mathcal {H}})=P (G,m)), then ({mathcal {H}}) has a canonical labeling.

We first give a proof of the Alon–Tarsi list coloring theorem that differs from Alon and Tarsi’s original. We use the ideas from this proof to obtain the following result, which is an additive coloring analog of the Alon–Tarsi Theorem: Let G be a graph and let D be an orientation of G. We introduce a new digraph (mathcal {W}(D)), such that if the out-degree in D of each vertex v is (d_v), and if the number of Eulerian subdigraphs of (mathcal {W}(D)) with an even number of edges differs from the number of Eulerian subdigraphs of (mathcal {W}(D)) with an odd number of edges, then for any assignment of lists L(v) of (d_v+1) positive integers to the vertices of G, there is an additive coloring of G assigning to each vertex v an element from L(v). As an application, we prove an additive list coloring result for tripartite graphs G such that one of the color classes of G contains only vertices whose neighborhoods are complete.

Schrijver graphs are vertex-color-critical subgraphs of Kneser graphs having the same chromatic number. They also share the value of their fractional chromatic number but Schrijver graphs are not critical for that. Here we present an induced subgraph of every Schrijver graph that is vertex-critical with respect to the fractional chromatic number. These subgraphs turn out to be isomorphic with certain circular complete graphs. We also characterize the critical edges within this subgraph.

Let G be a graph. A bisection of G is a bipartition of V(G) with (V(G)=V_1cup V_2), (V_1cap V_2=emptyset ) and (||V_1|-|V_2||le 1). Bollobás and Scott conjectured that every graph admits a bisection such that for every vertex, its external degree is greater than or equal to its internal degree minus one. In this paper, we confirm this conjecture for some regular graphs. Our results extend a result given by Ban and Linial (J Graph Theory 83:5–18, 2016). We also give an upper bound of the maximum bisection of graphs.

Let V be an n-dimensional vector space over the finite field ({mathbb {F}}_{q}) and let (left[ begin{array}{c} V k end{array}right] _q) denote the family of all k-dimensional subspaces of V. A family ({{mathcal {F}}}subseteq left[ begin{array}{c} V k end{array}right] _q) is called intersecting if for all F, (F'in {{mathcal {F}}},) we have ({textrm{dim}}(Fcap F')ge 1.) A family ({{mathcal {F}}}subseteq left[ begin{array}{c} V k end{array}right] _q) is called almost intersecting if for every (Fin {{mathcal {F}}}) there is at most one element (F'in {{mathcal {F}}}) satisfying ({textrm{dim}}(Fcap F')=0.) In this paper we investigate almost intersecting families in the vector space V. Firstly, for large n, we determine the maximum size of an almost intersecting family in (left[ begin{array}{c} V k end{array}right] _q,) which is the same as that of an intersecting family. Secondly, we characterize the structures of all maximum almost intersecting families under the condition that they are not intersecting.

We use the reciprocal transformation to propose the closed-form solutions to the conics through m points and tangent to n lines satisfying (m+n=5) in general position. We also derive the algebraic and geometric necessary and sufficient conditions for the non-degenerate real conics.

Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection of non-negative integer parameters of size (d + frac{d(d-1)}{2}) is adequate for describing symmetric association schemes of class d that are generated by the adjacency matrix of their first non-trivial relation. We use this to generate a database of the corresponding quotient-polynomial graphs that have small valency and up to 6 classes, and among these find new feasible parameter sets for symmetric association schemes with noncyclotomic eigenvalues.

In this note, we complete a classification of ternary extremal four-negacirculant self-dual codes of lengths 40, 44, 48, 52 and 60.

Galinier, Habib, and Paul introduced the reduced clique graph of a chordal graph G. The nodes of the reduced clique graph are the maximal cliques of G, and two nodes are joined by an edge if and only if they form a non-disjoint separating pair of cliques in G. In this case the weight of the edge is the size of the intersection of the two cliques. A clique tree of G is a tree with the maximal cliques of G as its nodes, where for any (vin V(G)), the subgraph induced by the nodes containing v is connected. Galinier et al. prove that a spanning tree of the reduced clique graph is a clique tree if and only if it has maximum weight, but their proof contains an error. We explain and correct this error. In addition, we initiate a study of the structure of reduced clique graphs by proving that they cannot contain any induced cycle of length five (although they may contain induced cycles of length three or any even integer greater than two). We show that no cycle of length four or more is isomorphic to a reduced clique graph. We prove that the class of clique graphs of chordal graphs is not comparable to the class of reduced clique graphs of chordal graphs by providing examples that are in each of these classes without being in the other.

A q-graph H on n vertices is a set of vectors of length n with all entries from ({0,1,dots ,q}) and every vector (that we call a q-edge) having exactly two non-zero entries. The support of a q-edge ({textbf{x}}) is the pair (S_{textbf{x}}) of indices of non-zero entries. We say that H is an s-copy of an ordinary graph F if (|H|=|E(F)|), F is isomorphic to the graph with edge set ({S_{textbf{x}}:{textbf{x}}in H}), and whenever (vin e,e'in E(F)), the entries with index corresponding to v in the q-edges corresponding to e and (e') sum up to at least s. E.g., the q-edges (1, 3, 0, 0, 0), (0, 1, 0, 0, 3), and (3, 0, 0, 0, 1) form a 4-triangle. The Turán number (mathop {}!textrm{ex}(n,F,q,s)) is the maximum number of q-edges that a q-graph H on n vertices can have if it does not contain any s-copies of F. In the present paper, we determine the asymptotics of (mathop {}!textrm{ex}(n,F,q,q+1)) for many graphs F.