中文
相关论文

相关论文: The open dihypergraph dichotomy and the second lev…

200 篇论文

The open graph dichotomy for a subset $X$ of the Baire space ${}^\omega\omega$ states that any open graph on $X$ either admits a coloring in countably many colors or contains a perfect complete subgraph. This strong version of the open…

逻辑 · 数学 2023-12-06 Philipp Schlicht , Dorottya Sziráki

We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the…

逻辑 · 数学 2009-05-29 Dominique Lecomte

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…

We introduce and study a notion of Borel order dimension for Borel quasi orders. It will be shown that this notion is closely related to the notion of Borel dichromatic number for simple directed graphs. We prove a dichotomy, which…

逻辑 · 数学 2024-09-11 Dilip Raghavan , Ming Xiao

Carroy, Miller, Schrittesser, and Vidny\'anszky established the $L_0$ dichotomy: there is a Borel graph of Borel chromatic number three that admits a continuous homomorphism to every analytic graph of Borel chromatic number at least three.…

逻辑 · 数学 2026-04-06 Tonatiuh Matos-Wiederhold

Generalizing classical descriptive set theory opens foundational questions about the Borel hierarchy. In this paper we systematically study those questions, working in the general framework of Polish-like spaces relative to an uncountable…

逻辑 · 数学 2025-11-20 Claudio Agostini , Nick Chapman , Luca Motto Ros , Beatrice Pitton

Generalizing a theorem of Campercholi, we characterize, in syntactic terms, the ranges of epimorphisms in an arbitrary class of similar first-order structures (as opposed to an elementary class). This allows us to strengthen a result of…

逻辑 · 数学 2020-05-26 T. Moraschini , J. G. Raftery , J. J. Wannenburg

We study the Borel and analytic subsets of the spaces \({}^{\kappa}\kappa\) and \({}^{\kappa}2\) endowed with ideal topologies, where \(\kappa\) is a regular uncountable cardinal. We establish that the Borel hierarchy does not collapse in…

逻辑 · 数学 2025-12-25 Miguel Moreno , Beatrice Pitton

We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we…

We show that there is no simple (e.g. finite or countable) basis for Borel graphs with infinite Borel chromatic number. In fact, it is proved that the closed subgraphs of the shift graph on $[\mathbb{N}]^{<\mathbb{N}}$ with finite (or,…

逻辑 · 数学 2021-05-28 Stevo Todorčević , Zoltán Vidnyánszky

We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…

逻辑 · 数学 2020-01-09 Samuel Coskey , Paul Ellis

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…

代数拓扑 · 数学 2014-07-02 Alexander Grigor'yan , Yong Lin , Yuri Muranov , Shing-Tung Yau

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

量子代数 · 数学 2007-05-23 Laure Helme-Guizon , Yongwu Rong

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

离散数学 · 计算机科学 2014-11-10 Pascal Schweitzer

The dichromatic number of a digraph $D$ is the minimum number of colors needed to color its vertices in such a way that each color class induces an acyclic digraph. As it generalizes the notion of the chromatic number of graphs, it has been…

组合数学 · 数学 2020-09-29 Pierre Aboulker , Pierre Charbit , Reza Naserasr

In this work, we continue the tradition initiated by Geschke, 2011 of viewing the uncountable Borel chromatic number of analytic graphs as cardinal invariants of the continuum. We show that various uncountable Borel chromatic numbers of…

逻辑 · 数学 2022-08-16 Michel Gaspar , Stefan Geschke

In this paper, we describe some recent spectral Moore theorems related to determining the maximum order of a connected graph of given valency and second eigenvalue. We show how these spectral Moore theorems have applications in Alon-Boppana…

组合数学 · 数学 2020-04-21 Sebastian M. Cioabă

We characterize the completely determined Borel subsets of HYP as exactly the omega_1^{ck} subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel…

逻辑 · 数学 2022-03-03 Henry Towsner , Rose Weisshaar , Linda Westrick

We discuss the Borel Tukey ordering on cardinal invariants of the continuum. We observe that this ordering makes sense for a larger class of cardinals than has previously been considered. We then provide a Borel version of a large portion…

逻辑 · 数学 2019-08-16 Samuel Coskey , Tamás Mátrai , Juris Steprāns

We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first…

组合数学 · 数学 2020-11-05 Alexander L. Gavrilyuk , Sho Suda
‹ 上一页 1 2 3 10 下一页 ›