Coloring face hypergraphs on surfaces

AbstractThe face hypergraph of a graph G embedded on a surface has the same vertex set as G and its edges are the sets of vertices forming faces of G. A hypergraph is k-choosable if for each assignment of lists of colors of sizes k to its vertices, there is a coloring of the vertices from these lists avoiding a monochromatic edge.We prove that the face hypergraph of the triangulation of a surface of Euler genus g is O(g3)-choosable. This bound matches a previously known lower bound of order Ω (g3). If each face of the graph is incident with at least r distinct vertices, then the face hypergraph is also O(gr)-choosable. Note that colorings of face hypergraphs for r=2 correspond to usual vertex colorings and the upper bound O(g) thus follows from Heawood’s formula. Separate results for small genera are presented: the bound 3 for triangulations of the surface of Euler genus g=3 and the bound 7+36g+496 for surfaces of Euler genus g≥3. Our results dominate the previously known bounds for all genera except for g=4,7,8,9,14

Generalized Colorings of Graphs

A graph coloring is an assignment of labels called “colors” to certain elements of a graph subject to certain constraints. The proper vertex coloring is the most common type of graph coloring, where each vertex of a graph is assigned one color such that no two adjacent vertices share the same color, with the objective of minimizing the number of colors used. One can obtain various generalizations of the proper vertex coloring problem, by strengthening or relaxing the constraints or changing the objective. We study several types of such generalizations in this thesis. Series-parallel graphs are multigraphs that have no K4-minor. We provide bounds on their fractional and circular chromatic numbers and the defective version of these pa-rameters. In particular we show that the fractional chromatic number of any series-parallel graph of odd girth k is exactly 2k/(k − 1), confirming a conjecture by Wang and Yu. We introduce a generalization of defective coloring: each vertex of a graph is assigned a fraction of each color, with the total amount of colors at each vertex summing to 1. We define the fractional defect of a vertex v to be the sum of the overlaps with each neighbor of v, and the fractional defect of the graph to be the maximum of the defects over all vertices. We provide results on the minimum fractional defect of 2-colorings of some graphs. We also propose some open questions and conjectures. Given a (not necessarily proper) vertex coloring of a graph, a subgraph is called rainbow if all its vertices receive different colors, and monochromatic if all its vertices receive the same color. We consider several types of coloring here: a no-rainbow-F coloring of G is a coloring of the vertices of G without rainbow subgraph isomorphic to F ; an F -WORM coloring of G is a coloring of the vertices of G without rainbow or monochromatic subgraph isomorphic to F ; an (M, R)-WORM coloring of G is a coloring of the vertices of G with neither a monochromatic subgraph isomorphic to M nor a rainbow subgraph isomorphic to R. We present some results on these concepts especially with regards to the existence of colorings, complexity, and optimization within certain graph classes. Our focus is on the case that F , M or R is a path, cycle, star, or clique

An extensive English language bibliography on graph theory and its applications

Bibliography on graph theory and its application

Looseness of Planar Graphs

International audienceA face of a vertex coloured plane graph is called loose if the number of colours used on its vertices is at least three. The looseness of a plane graph G is the minimum k such that any surjective k-colouring involves a loose face. In this paper we prove that the looseness of a connected plane graph G equals the maximum number of vertex disjoint cycles in the dual graph G increased by 2. We also show upper bounds on the looseness of graphs based on the number of vertices, the edge connectivity, and the girth of the dual graphs. These bounds improve the result of Negami for the looseness of plane triangulations. We also present infinite classes of graphs where the equalities are attained

Topological Phases: An Expedition off Lattice

Motivated by the goal to give the simplest possible microscopic foundation for a broad class of topological phases, we study quantum mechanical lattice models where the topology of the lattice is one of the dynamical variables. However, a fluctuating geometry can remove the separation between the system size and the range of local interactions, which is important for topological protection and ultimately the stability of a topological phase. In particular, it can open the door to a pathology, which has been studied in the context of quantum gravity and goes by the name of `baby universe', Here we discuss three distinct approaches to suppressing these pathological fluctuations. We complement this discussion by applying Cheeger's theory relating the geometry of manifolds to their vibrational modes to study the spectra of Hamiltonians. In particular, we present a detailed study of the statistical properties of loop gas and string net models on fluctuating lattices, both analytically and numerically.Comment: 38 pages, 22 figure

Phase diagram of the triangular-lattice Potts antiferromagnet

We study the phase diagram of the triangular-lattice Q-state Potts model in the real (Q, v)-plane, where v - e(J) - 1 is the temperature variable. Our first goal is to provide an obviously missing feature of this diagram: the position of the antiferromagnetic critical curve. This curve turns out to possess a bifurcation point with two branches emerging from it, entailing important consequences for the global phase diagram. We have obtained accurate numerical estimates for the position of this curve by combining the transfer-matrix approach for strip graphs with toroidal boundary conditions and the recent method of critical polynomials. The second goal of this work is to study the corresponding A(p-1) RSOS model on the torus, for integer p = 4, 5,..., 8. We clarify its relation to the corresponding Potts model, in particular concerning the role of boundary conditions. For certain values of p, we identify several new critical points and regimes for the RSOS model and we initiate the study of the flows between the corresponding field theories.The research of JLJ was supported in part by the Agence Nationale de la Recherche (grant ANR-10-BLAN-0414: DIME), the Institut Universitaire de France, and the European Research Council (through the advanced grant NuQFT). The research of JLJ and JS was supported in part by Spanish MINECO grant FIS2014-57387-C3-3-P. The work of CRS was performed under the auspices of the U.S. Department of Energy at the Lawrence Livermore National Laboratory under Contract No DE-AC52-07NA27344

SparsePak: A Formatted Fiber Field-Unit for The WIYN Telescope Bench Spectrograph. II. On-Sky Performance

We present a performance analysis of SparsePak and the WIYN Bench Spectrograph for precision studies of stellar and ionized gas kinematics of external galaxies. We focus on spectrograph configurations with echelle and low-order gratings yielding spectral resolutions of ~10000 between 500-900nm. These configurations are of general relevance to the spectrograph performance. Benchmarks include spectral resolution, sampling, vignetting, scattered light, and an estimate of the system absolute throughput. Comparisons are made to other, existing, fiber feeds on the WIYN Bench Spectrograph. Vignetting and relative throughput are found to agree with a geometric model of the optical system. An aperture-correction protocol for spectrophotometric standard-star calibrations has been established using independent WIYN imaging data and the unique capabilities of the SparsePak fiber array. The WIYN point-spread-function is well-fit by a Moffat profile with a constant power-law outer slope of index -4.4. We use SparsePak commissioning data to debunk a long-standing myth concerning sky-subtraction with fibers: By properly treating the multi-fiber data as a ``long-slit'' it is possible to achieve precision sky subtraction with a signal-to-noise performance as good or better than conventional long-slit spectroscopy. No beam-switching is required, and hence the method is efficient. Finally, we give several examples of science measurements which SparsePak now makes routine. These include H$\alpha$ velocity fields of low surface-brightness disks, gas and stellar velocity-fields of nearly face-on disks, and stellar absorption-line profiles of galaxy disks at spectral resolutions of ~24,000.Comment: To appear in ApJSupp (Feb 2005); 19 pages text; 7 tables; 27 figures (embedded); high-resolution version at http://www.astro.wisc.edu/~mab/publications/spkII_pre.pd

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization

International audienceThe Cologne-Twente Workshop (CTW) on Graphs and Combinatorial Optimization started off as a series of workshops organized bi-annually by either Köln University or Twente University. As its importance grew over time, it re-centered its geographical focus by including northern Italy (CTW04 in Menaggio, on the lake Como and CTW08 in Gargnano, on the Garda lake). This year, CTW (in its eighth edition) will be staged in France for the first time: more precisely in the heart of Paris, at the Conservatoire National d’Arts et Métiers (CNAM), between 2nd and 4th June 2009, by a mixed organizing committee with members from LIX, Ecole Polytechnique and CEDRIC, CNAM