The following pages link to Mark H. Siggers (Q1003658):
Displaying 42 items.
- (Q326479) (redirect page) (← links)
- Characterisation of forests with trivial game domination numbers (Q326480) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families (Q458297) (← links)
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families (Q516792) (← links)
- A strong Mal'cev condition for locally finite varieties omitting the unary type (Q616117) (← links)
- The maximum size of intersecting and union families of sets (Q657996) (← links)
- (Q864902) (redirect page) (← links)
- Integer and fractional packings of hypergraphs (Q864903) (← links)
- On a question of Dirac on critical and vertex critical graphs (Q890907) (← links)
- (Q960959) (redirect page) (← links)
- Note on robust critical graphs with large odd girth (Q960960) (← links)
- Dichotomy for bounded degree \(H\)-colouring (Q1003659) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- On the complexity of \(H\)-colouring planar graphs (Q1045065) (← links)
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- Recolouring reflexive digraphs (Q1744757) (← links)
- Reconfiguring graph homomorphisms on the sphere (Q1987080) (← links)
- Reflexive graphs with near unanimity but no semilattice polymorphisms (Q1991407) (← links)
- Reconfiguration of homomorphisms to reflexive digraph cycles (Q2032862) (← links)
- A reflexive digraph that is retraction trivial but not endomorphism trivial (Q2065890) (← links)
- AK-type stability theorems on cross \(t\)-intersecting families (Q2323248) (← links)
- Decompositions of graphs into trees, forests, and regular subgraphs (Q2342619) (← links)
- Non-bipartite pairs of 3-connected graphs are highly Ramsey-infinite (Q2441625) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- Recolouring homomorphisms to triangle-free reflexive graphs (Q2688244) (← links)
- A New Proof of the <i>H</i>-Coloring Dichotomy (Q3058556) (← links)
- Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case (Q3192166) (← links)
- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete (Q3525565) (← links)
- Potentially H-bigraphic sequences (Q3560784) (← links)
- On highly ramsey infinite graphs (Q3605143) (← links)
- On Ramsey Minimal Graphs (Q3629457) (← links)
- Distributive Lattice Polymorphism on Reflexive Graphs (Q4576639) (← links)
- NU Polymorphisms on Reflexive Digraphs (Q4610183) (← links)
- Graph homomorphism reconfiguration and frozen H‐colorings (Q5066895) (← links)
- On the representation of finite distributive lattices (Q5125121) (← links)
- Five Cycles are Highly Ramsey Infinite (Q5407176) (← links)
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case (Q5408602) (← links)
- Color critical hypergraphs with many edges (Q5487778) (← links)
- Mixing is hard for triangle-free reflexive graphs (Q6146497) (← links)
- (Q6185533) (← links)
- Towards a dichotomy for the switch list homomorphism problem for signed graphs (Q6505094) (← links)
