中文
相关论文

相关论文: Grad and classes with bounded expansion III. restr…

200 篇论文

Call a colouring of a graph distinguishing, if the only colour preserving automorphism is the identity. A conjecture of Tucker states that if every automorphism of a graph $G$ moves infinitely many vertices, then there is a distinguishing…

组合数学 · 数学 2018-10-10 Florian Lehner , Monika Pilśniak , Marcin Stawiski

Harm Derksen made a conjecture concerning degree bounds for the syzygies of rings of polynomial invariants in the non-modular case. We provide counterexamples to this conjecture, but also prove a slightly weakened version. We also prove…

交换代数 · 数学 2014-10-02 Marc Chardin , Peter Symonds

We define duality triples and duality pairs in compactly generated triangulated categories and investigate their properties. This enables us to give an elementary way to determine whether a class is closed under pure subobjects, pure…

范畴论 · 数学 2024-09-16 Isaac Bird , Jordan Williamson

We advance a probabilistic approach to the Hadwiger-Nelson problem initially developed by the Polymath16 project, in particular relating the approach to finite unit-distance graphs. We define the numerical \textit{badness} of a given…

组合数学 · 数学 2020-08-19 Haydn Gwyn , Jacob Stavrianos

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

组合数学 · 数学 2020-07-21 Florian Lehner , Monika Pilśniak , Marcin Stawiski

A procedure for constructing bivariant theories by means of Grothendieck duality is developed. This produces, in particular, a bivariant theory of Hochschild (co)homology on the category of schemes that are flat, separated and essentially…

代数几何 · 数学 2015-11-20 Leovigildo Alonso Tarrío , Ana Jeremías López , Joseph Lipman

In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…

组合数学 · 数学 2012-03-01 Iain Moffatt

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…

The theory of convergent graph sequences has been worked out in two extreme cases, dense graphs and bounded degree graphs. One can define convergence in terms of counting homomorphisms from fixed graphs into members of the sequence…

组合数学 · 数学 2010-02-02 Christian Borgs , Jennifer Chayes , Jeff Kahn , László Lovász

The aim of this paper is to introduce the notion of restricted Hom- Lie superalgebras. This class of algebras is a generalization of both restricted Hom-Lie algebras and restricted Lie superalgebras. In this paper, we present a way to…

环与代数 · 数学 2022-11-02 Shadi Shaqaqha

The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…

离散数学 · 计算机科学 2019-09-25 Wojciech Nadara , Marcin Pilipczuk , Roman Rabinovich , Felix Reidl , Sebastian Siebertz

We prove a number of basic vanishing results for modified diagonal classes. We also obtain some sharp results for modified diagonals of curves and abelian varieties, and we prove a conjecture of O'Grady about modified diagonals on double…

代数几何 · 数学 2014-05-08 Ben Moonen , Qizheng Yin

This paper extends some results of Hatcher and Quinn beyond the metastable range. We give a bordism theoretic obstruction to deforming a map between manifolds simultaneously off of a collection of pairwise disjoint submanifolds under the…

代数拓扑 · 数学 2019-05-29 John R. Klein , Bruce Williams

Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…

组合数学 · 数学 2010-10-26 László Lovász , Balázs Szegedy

We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.

组合数学 · 数学 2012-01-19 Klaus Dohmen

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…

组合数学 · 数学 2022-12-22 Brendan D. McKay , Fiona Skerman

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

计算机科学中的逻辑 · 计算机科学 2025-06-26 Georg Schindling

We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…

计算复杂性 · 计算机科学 2012-10-10 Mikael Gast , Mathias Hauptmann , Marek Karpinski

We solve the problem on flat extensions of a generic surface with boundary in Euclidean 3-space, relating it to the singularity theory of the envelope generated by the boundary. We give related results on Legendre surfaces with boundaries…

微分几何 · 数学 2010-01-08 Goo Ishikawa

A main purpose of this paper is to prove that the class of finite dimensional algebras which verify Han's conjecture is closed under split bounded extensions.

K理论与同调 · 数学 2021-03-01 Claude Cibils , Marcelo Lanzilotta , Eduardo N. Marcos , Andrea Solotar