Results for 'chromatic number'

959 found
Order:
  1.  42
    Measurable chromatic numbers.Benjamin D. Miller - 2008 - Journal of Symbolic Logic 73 (4):1139-1157.
    We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three. In particular, this holds for the graph of the unilateral shift on [N]N, although its Borel chromatic number is N₀. We also show that if add(null) = c, then the universally measurable chromatic number of every treeing of a measure amenable equivalence relation (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  1
    Ramsey, expanders, and Borel chromatic numbers.Jan Grebík & Zoltán Vidnyánszky - forthcoming - Journal of Mathematical Logic.
    Journal of Mathematical Logic, Ahead of Print. We construct bounded degree acyclic Borel graphs with large Borel chromatic number using a graph arising from Ramsey theory and limits of expander sequences.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. Ramsey, expanders, and Borel chromatic numbers.Jan Grebík & Zoltán Vidnyánszky - forthcoming - Journal of Mathematical Logic.
    We construct bounded degree acyclic Borel graphs with large Borel chromatic number using a graph arising from Ramsey theory and limits of expander sequences.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  4.  18
    On chromatic number of graphs and set systems.P. Erdös, A. Hajnal & B. Rothchild - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 531--538.
  5.  16
    Deciding the chromatic numbers of algebraic hypergraphs.James H. Schmerl - 2018 - Journal of Symbolic Logic 83 (1):128-145.
    For each infinite cardinalκ, the set of algebraic hypergraphs having chromatic number no larger thanκis decidable.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  26
    Weak Borel chromatic numbers.Stefan Geschke - 2011 - Mathematical Logic Quarterly 57 (1):5-13.
    Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G -independent Borel sets that covers all of X. Here a set of vertices of a graph G is independent if no two vertices in the set are connected by an edge.We show that it is consistent with an arbitrarily large size of the continuum that every closed graph (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  36
    Basis theorems for non-potentially closed sets and graphs of uncountable borel chromatic number.Dominique Lecomte & Benjamin D. Miller - 2008 - Journal of Mathematical Logic 8 (2):121-162.
    We show that there is an antichain basis for neither the class of non-potentially closed Borel subsets of the plane under Borel rectangular reducibility nor the class of analytic graphs of uncountable Borel chromatic number under Borel reducibility.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  30
    On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  9.  33
    On the complexity of finding the chromatic number of a recursive graph II: the unbounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (3):227-246.
  10.  56
    On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
    A recursive graph is a graph whose vertex and edge sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively determine the neighbors of a vertex. Both of these have been studied in the literature. We consider an intermediary notion: Let A be a set. An A-recursive graph is a recursive graph that also has the following property: one can recursively-in-A determine the neighbors of a vertex. We show that, if (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  11.  15
    C. T. Conley and B. D. Miller, A bound on measurable chromatic numbers of locally finite Borel graphs. Mathematical Research Letters, vol. 23, no. 6 , pp. 1633–1644. [REVIEW]Anush Tserunyan - 2017 - Bulletin of Symbolic Logic 23 (3):334-336.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  12.  77
    James E. Baumgartner. Generic graph construction. The journal of symbolic logic, vol. 49 , pp. 234–240. - Matthew Foreman and Richard Laver. Some downwards transfer properties for ℵ2. Advances in mathematics, vol. 67 , pp. 230–238. - Saharon Shelah. Incompactness for chromatic numbers of graphs. A tribute to Paul Erdős, edited by A. Baker, B. Bollobas, and A. Hajnal, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1990, pp. 361–371. [REVIEW]Peter Komjath - 2001 - Bulletin of Symbolic Logic 7 (4):539-541.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  13. Chromatic diversity of natural scenes.J. M. M. Linhares, S. M. C. Nascimento, D. H. Foster & K. Amano - 1996 - In Enrique Villanueva (ed.), Perception. Ridgeview Pub. Co. pp. 65-65.
    The number of discriminable colours is often assumed to be of the order of several million but the extent of detectable chromatic diversity present in individual natural scenes is an open question. Here, the aim was to estimate the number of discriminable colours seen in natural scenes. Hyperspectral data were obtained from a set of natural scenes over the range 400 - 720 nm at 10 nm intervals (Nascimento et al, 2002 Journal of the Optical Society of (...)
     
    Export citation  
     
    Bookmark  
  14.  11
    Chromatic aberration of eyepieces in early telescopes.M. Rudd - 2007 - Annals of Science 64 (1):1-18.
    Summary The twofold objective of this study is (1) to identify and give a brief review of the historical development of the various designs of early (pre-1850) telescope eyepieces, and (2) to determine by measurements and calculations the axial and lateral chromatic aberrations of a number of extant eyepieces from that period in order to provide basic data on which to judge the relative quality of different eyepiece forms. Eight distinct types of eyepieces containing one to five lens (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  15.  39
    Chromatic aberration of eyepieces in early telescopes.M. Eugene Rudd - 2007 - Annals of Science 64 (1):1-18.
    Summary The twofold objective of this study is (1) to identify and give a brief review of the historical development of the various designs of early (pre-1850) telescope eyepieces, and (2) to determine by measurements and calculations the axial and lateral chromatic aberrations of a number of extant eyepieces from that period in order to provide basic data on which to judge the relative quality of different eyepiece forms. Eight distinct types of eyepieces containing one to five lens (...)
    No categories
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  16.  59
    Chromatically rich phenomenal percepts.John Beeckmans - 2004 - Philosophical Psychology 17 (1):27-44.
    Visual percepts frequently appear chromatically rich, yet their paucity in reportable information has led to widely accepted minimalist models of vision. The discrepancy may be resolved by positing that the richness of natural scenes is reflected in phenomenal consciousness but not in detail in the phenomenal judgments upon which reports about qualia are based. Conceptual awareness (including phenomenal judgments) arises from neural mechanisms that categorize objects, and also from mechanisms that conceptually characterize textural properties of pre-categorically segmented regions in the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  21
    Klee and kandinsky polyphonic painting, chromatic chords and synaesthesia.Amy Ione - 2004 - Journal of Consciousness Studies 11 (3-4):148-158.
    As an artist I admittedly scrutinize all of the theories related to the arts closely. I do this for a number of reasons. The obvious one is that I have a deeply felt personal relationship with the subject matter. Less obvious is my experience in general. My early research was motivated by a desire to discover the historical circumstances that led to the difficulty in fitting visual art into the discussions I encountered. Generally, it seemed that the dominant framework (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  25
    Wild edge colourings of graphs.Mirna D.?Amonja, P.�Ter Komj�Th & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255-264.
    We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinalμ, of cofinalityω, such that everyμ+-chromatic graphXonμ+has an edge colouringcofXintoμcolours for which every vertex colouringgofXinto at mostμmany colours has ag-colour class on whichctakes every value.The paper also contains some generalisations of the above statement in whichμ+is replaced by other cardinals >μ.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  19. Wild edge colourings of graphs.Mirna Džamonja, Péter Komjáth & Charles Morgan - 2004 - Journal of Symbolic Logic 69 (1):255 - 264.
    We prove consistent, assuming there is a supercompact cardinal, that there is a singular strong limit cardinal $\mu$ , of cofinality $\omega$ , such that every $\mu^{+}$ -chromatic graph X on $\mu^{+}$ has an edge colouring c of X into $\mu$ colours for which every vertex colouring g of X into at most $\mu$ many colours has a g-colour class on which c takes every value. The paper also contains some generalisations of the above statement in which $\mu^{+}$ is (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  20.  80
    Erdős graphs resolve fine's canonicity problem.Robert Goldblatt, Ian Hodkinson & Yde Venema - 2004 - Bulletin of Symbolic Logic 10 (2):186-208.
    We show that there exist 2 ℵ 0 equational classes of Boolean algebras with operators that are not generated by the complex algebras of any first-order definable class of relational structures. Using a variant of this construction, we resolve a long-standing question of Fine, by exhibiting a bimodal logic that is valid in its canonical frames, but is not sound and complete for any first-order definable class of Kripke frames (a monomodal example can then be obtained using simulation results of (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21.  34
    Generic graph construction.James E. Baumgartner - 1984 - Journal of Symbolic Logic 49 (1):234-240.
    It is shown that if ZF is consistent, then so is ZFC + GCH + "There is a graph with cardinality ℵ 2 and chromatic number ℵ 2 such that every subgraph of cardinality ≤ ℵ 1 has chromatic number ≤ ℵ 0 ". This partially answers a question of Erdos and Hajnal.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  22.  82
    Strongly representable atom structures of cylindric algebras.Robin Hirsch & Ian Hodkinson - 2009 - Journal of Symbolic Logic 74 (3):811-828.
    A cylindric algebra atom structure is said to be strongly representable if all atomic cylindric algebras with that atom structure are representable. This is equivalent to saying that the full complex algebra of the atom structure is a representable cylindric algebra. We show that for any finite n >3, the class of all strongly representable n-dimensional cylindric algebra atom structures is not closed under ultraproducts and is therefore not elementary. Our proof is based on the following construction. From an arbitrary (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  23.  18
    Coloring Isosceles Triangles in Choiceless Set Theory.Yuxin Zhou - forthcoming - Journal of Symbolic Logic:1-30.
    It is consistent relative to an inaccessible cardinal that ZF+DC holds, and the hypergraph of isosceles triangles on $\mathbb {R}^2$ has countable chromatic number while the hypergraph of isosceles triangles on $\mathbb {R}^3$ has uncountable chromatic number.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  57
    Dichotomy theorems for countably infinite dimensional analytic hypergraphs.Benjamin D. Miller - 2011 - Annals of Pure and Applied Logic 162 (7):561-565.
    We give classical proofs, strengthenings, and generalizations of Lecomte’s characterizations of analytic ω-dimensional hypergraphs with countable Borel chromatic number.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  20
    Infinite combinatorics plain and simple.Dániel T. Soukup & Lajos Soukup - 2018 - Journal of Symbolic Logic 83 (3):1247-1281.
    We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already, we significantly broaden this framework by developing the corresponding technique for countably closed models of size continuum. The applications range from various theorems on paradoxical decompositions of the plane, to coloring sparse set systems, results on graph chromatic number and constructions from point-set topology. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  26.  93
    The graph-theoretic approach to descriptive set theory.Benjamin D. Miller - 2012 - Bulletin of Symbolic Logic 18 (4):554-575.
    We sketch the ideas behind the use of chromatic numbers in establishing descriptive set-theoretic dichotomy theorems.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  27.  25
    [Omnibus Review].James E. Baumgartner - 1985 - Journal of Symbolic Logic 50 (1):239-240.
    Reviewed Works:Edwin W. Miller, On a Property of Families of Sets.Ben Dushnik, E. W. Miller, Partially Ordered Sets.P. Erdos, Some Set-theoretical Properties of Graphs.G. Fodor, Proof of a Conjecture of P. Erdos.P. Erdos, R. Rado, A Partition Calculus in Set Theory.P. Erdos, R. Rado, Intersection Theorems for Systems of Sets.A. Hajnal, Some Results and Problems on Set Theory.P. Erdos, A. Hajnal, On a Property of Families of Sets.A. Hajnal, Proof of a Conjecture of S. Ruziewicz.P. Erdos, A. Hajnal, R. Rado, (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  5
    Borel Line Graphs.James Anderson & Anton Bernshteyn - forthcoming - Journal of Symbolic Logic:1-22.
    We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the nine finite graphs from the classical result of Beineke together with a 10th infinite graph associated with the equivalence relation $\mathbb {E}_0$ on the Cantor space. As a corollary, we prove a partial converse to the Feldman–Moore theorem, which allows us to characterize all locally countable Borel line graphs in terms of their Borel chromatic numbers.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  18
    Same graph, different universe.Assaf Rinot - 2017 - Archive for Mathematical Logic 56 (7):783-796.
    May the same graph admit two different chromatic numbers in two different universes? How about infinitely many different values? and can this be achieved without changing the cardinals structure? In this paper, it is proved that in Gödel’s constructible universe, for every uncountable cardinal $$\mu $$ below the first fixed-point of the $$\aleph $$ -function, there exists a graph $$\mathcal G_\mu $$ satisfying the following.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  37
    Reverse Mathematics and Grundy colorings of graphs.James H. Schmerl - 2010 - Mathematical Logic Quarterly 56 (5):541-548.
    The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investi-gated.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  31.  36
    A generalization of the ????0 dichotomy and a strengthening of the ????0ℕ dichotomy.Benjamin D. Miller - 2022 - Journal of Mathematical Logic 22 (1).
    We generalize the [Formula: see text] dichotomy to doubly-indexed sequences of analytic digraphs. Under a mild definability assumption, we use this generalization to characterize the family of Borel actions of tsi Polish groups on Polish spaces that can be decomposed into countably-many Borel actions admitting complete Borel sets that are lacunary with respect to an open neighborhood of the identity. We also show that if the group in question is non-archimedean, then the inexistence of such a decomposition yields a special (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  32. Pair-splitting, pair-reaping and cardinal invariants of F σ -ideals.Michael Hrušák, David Meza-Alcántara & Hiroaki Minami - 2010 - Journal of Symbolic Logic 75 (2):661-677.
    We investigate the pair-splitting number $\germ{s}_{pair}$ which is a variation of splitting number, pair-reaping number $\germ{r}_{pair}$ which is a variation of reaping number and cardinal invariants of ideals on ω. We also study cardinal invariants of F σ ideals and their upper bounds and lower bounds. As an application, we answer a question of S. Solecki by showing that the ideal of finitely chromatic graphs is not locally Katětov-minimal among ideals not satisfying Fatou's lemma.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  33.  56
    Color spaces and color order systems, a primer.Rolf Kuehni - 2010 - In Jonathan Cohen & Mohan Matthen (eds.), Color Ontology and Color Science. Bradford.
    This chapter discusses the ordering of color percepts, and starts by presenting an overview of the critical issues surrounding the topic and by examining the relationship between stimuli and percepts. Certain types of variability were found by experimental psychology in the relationship between stimulus and response as a result of observation conditions. In the twentieth century, the view that the normal human color-vision system has a standard implementation and that all perceptual data are appropriately treated with normal statistical distribution methodology (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  34. Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
    We are concerned here with recursive function theory analogs of certain problems in chromatic graph theory. The motivating question for our work is: Does there exist a recursive (countably infinite) planar graph with no recursive 4-coloring? We obtain the following results: There is a 3-colorable, recursive planar graph which, for all k, has no recursive k-coloring; every decidable graph of genus p ≥ 0 has a recursive 2(χ(p) - 1)-coloring, where χ(p) is the least number of colors which (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  35.  24
    A logician's view of graph polynomials.J. A. Makowsky, E. V. Ravve & T. Kotek - 2019 - Annals of Pure and Applied Logic 170 (9):1030-1069.
    Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we distinguish between the graph theoretic (semantic) and the algebraic (syntactic) meaning of graph polynomials. Graph polynomials appear in the literature either as generating functions, as generalized chromatic polynomials, or as polynomials derived via determinants of adjacency or Laplacian matrices. We show (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  36. 3. the monotone series and multiplier and divisor relative numbers.Divisor Relative Numbers - 1987 - International Logic Review: Rassegna Internazionale di Logica 15 (1):26.
     
    Export citation  
     
    Bookmark  
  37. The Creationists: The Evolution of Scientific Creationism.R. L. Numbers & M. Bridgstock - 1994 - Annals of Science 51 (6):664-664.
     
    Export citation  
     
    Bookmark   10 citations  
  38.  8
    Science and Christianity in Pulpit and Pew.Ronald L. Numbers - 2007 - Oxford University Press USA.
    As past president of both the History of Science Society and the American Society of Church History, Ronald L. Numbers is uniquely qualified to assess the historical relations between science and Christianity. In this collection of his most recent essays, he moves beyond the clichés of conflict and harmony to explore the tangled web of historical interactions involving scientific and religious beliefs. In his lead essay he offers an unprecedented overview of the history of science and Christianity from the perspective (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  39.  14
    Creation by Natural Law: Laplace's Nebular Hypothesis in American Thought.Ronald L. Numbers - 1979 - Philosophy of Science 46 (1):167-169.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  40.  11
    Selected Works of George Mccready Price: A ten-Volume Anthology of Documents, 1903–1961.Ronald L. Numbers - 1995 - Routledge.
    Originally published in 1995, The Selected Works of George McCready Price is the seventh volume in the series, Creationism in Twentieth Century America, reissued in 2019. The volume brings together the original writings and pamphlets of George McCready Price, a leading creationist of the early antievolution crusade of the 1920s. McCready Price labelled himself the 'principal scientific authority of the Fundamentalists' and as a self-taught scientist he enjoyed more scientific repute amongst fundamentalists of the time. This interesting and unique collection (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  41.  22
    Editorial: Farewells and Introductions.Ronald Numbers - 1989 - Isis 80 (1):6-10.
  42.  8
    Inherit the Wind.Ronald Numbers - 1993 - Isis 84:763-764.
    Direct download  
     
    Export citation  
     
    Bookmark  
  43.  36
    Sex, Diet, and Debility in Jacksonian America: Sylvester Graham and Health Reform. Stephen Nissenbaum.Ronald Numbers - 1981 - Isis 72 (2):309-309.
  44. The Scientific Enterprise in America: Readings from Isis.Ronald L. Numbers, Charles E. Rosenberg & S. Hong - 1998 - Annals of Science 55 (3):323-324.
    No categories
     
    Export citation  
     
    Bookmark  
  45.  30
    American Medical Schools and the Practice of Medicine: A HistoryWilliam G. Rothstein.Ronald Numbers - 1989 - Isis 80 (3):559-560.
  46. Book notices-disseminating darwinism: The role of place, race, religion, and gender.Ronald L. Numbers & John Steenhouse - 2002 - History and Philosophy of the Life Sciences 24 (3-4):546.
  47.  34
    Crusaders for Fitness: The History of American Health Reformers. James C. Whorton.Ronald Numbers - 1983 - Isis 74 (4):620-621.
  48.  26
    Redeeming Culture: American Religion in an Age of Science. James Gilbert.Ronald Numbers - 1999 - Isis 90 (2):382-383.
  49.  11
    The Antievolution Works of Arthur I. Brown: A Ten-Volume Anthology of Documents, 1903–1961.Ronald L. Numbers - 1995 - Routledge.
    Originally published in 1995, The Antievolution Works of Arthur I. Brown is the third volume in the series, Creationism in Twentieth Century America. The volume brings together original sources from the prominent surgeon and creationist Arthur I. Brown. Brown discredited evolution as it was contrary to the 'clear statements of scripture' which he believed infallible, stating evolution instead to be both a hoax and 'a weapon of Satan'. The works included focus on Brown's polemic through his early twentieth century writings. (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  50.  30
    The History of the Health Care Sciences and Health Care, 1700-1980: A Selective Annotated BibliographyJonathon Erlen.Ronald Numbers - 1986 - Isis 77 (1):144-145.
1 — 50 / 959