Mark H. Siggers

From MaRDI portal
Person:1003658

Available identifiers

zbMath Open siggers.mark-hMaRDI QIDQ1003658

List of research outcomes

PublicationDate of PublicationType
Mixing is hard for triangle-free reflexive graphs2024-02-05Paper
https://portal.mardi4nfdi.de/entity/Q61855332024-01-29Paper
Recolouring homomorphisms to triangle-free reflexive graphs2023-03-02Paper
Complexity Framework for Forbidden Subgraphs II: When Hardness Is Not Preserved under Edge Subdivision2022-11-25Paper
A Brightwell-Winkler type characterisation of NU graphs2022-08-08Paper
Graph homomorphism reconfiguration and frozen H‐colorings2022-03-31Paper
A reflexive digraph that is retraction trivial but not endomorphism trivial2022-01-13Paper
Reconfiguration of homomorphisms to reflexive digraph cycles2021-06-14Paper
On the representation of finite distributive lattices2020-10-05Paper
Reconfiguring graph homomorphisms on the sphere2020-04-09Paper
AK-type stability theorems on cross \(t\)-intersecting families2019-08-30Paper
Reflexive graphs with near unanimity but no semilattice polymorphisms2018-10-30Paper
A complexity dichotomy for signed \(\mathbf{H}\)-colouring2018-08-15Paper
Distributive Lattice Polymorphism on Reflexive Graphs2018-07-10Paper
Recolouring reflexive digraphs2018-04-19Paper
NU Polymorphisms on Reflexive Digraphs2018-04-06Paper
Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families2017-03-15Paper
Characterisation of forests with trivial game domination numbers2016-10-12Paper
On a question of Dirac on critical and vertex critical graphs2015-11-16Paper
Decompositions of graphs into trees, forests, and regular subgraphs2015-04-29Paper
An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families2014-10-07Paper
Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case2014-09-26Paper
Locally injective \(k\)-colourings of planar graphs2014-08-22Paper
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case2014-04-10Paper
Five Cycles are Highly Ramsey Infinite2014-04-04Paper
Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite2014-03-25Paper
Semilattice polymorphisms and chordal graphs2014-03-25Paper
The maximum size of intersecting and union families of sets2012-01-11Paper
A strong Mal'cev condition for locally finite varieties omitting the unary type2011-01-07Paper
A New Proof of the H-Coloring Dichotomy2010-12-03Paper
Potentially H-bigraphic sequences2010-05-14Paper
Note on robust critical graphs with large odd girth2010-03-29Paper
On the complexity of \(H\)-colouring planar graphs2009-12-15Paper
A combinatorial constraint satisfaction problem dichotomy classification conjecture2009-12-01Paper
On Ramsey Minimal Graphs2009-05-27Paper
Dichotomy for bounded degree \(H\)-colouring2009-03-04Paper
On highly ramsey infinite graphs2009-02-20Paper
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete2008-09-17Paper
Integer and fractional packings of hypergraphs2007-02-13Paper
Color critical hypergraphs with many edges2006-09-12Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Mark H. Siggers