Sophie Spirkl

From MaRDI portal
Person:345122

Available identifiers

zbMath Open spirkl.sophie-theresaMaRDI QIDQ345122

List of research outcomes





PublicationDate of PublicationType
On heroes in digraphs with forbidden induced forests2025-01-16Paper
Induced subgraphs and tree decompositions2025-01-14Paper
Pure pairs. VIII: Excluding a sparse graph2025-01-14Paper
Induced subgraphs and tree decompositions. XIV: Non-adjacent neighbours in a hole2024-12-27Paper
Induced subgraphs and tree decompositions. VI: Graphs with 2-cutsets2024-11-09Paper
Tree independence number. I. (Even hole, diamond, pyramid)-free graphs2024-07-02Paper
Homogeneous sets in graphs and a chromatic multisymmetric function2024-06-28Paper
List-3-coloring ordered graphs with a forbidden induced subgraphs2024-04-23Paper
Four-Coloring \(\boldsymbol{P_6}\)-Free Graphs. II. Finding an Excellent Precoloring2024-03-19Paper
Four-Coloring \(P_6\)-Free Graphs. I. Extending an Excellent Precoloring2024-02-28Paper
Induced subgraphs and tree decompositions V. one neighbor in a hole2024-02-23Paper
Pure Pairs. IX. Transversal Trees2024-02-07Paper
Bipartite graphs with no \(K_6\) minor2024-01-29Paper
Induced subgraphs and tree decompositions. II: Toward walls and their line graphs in graphs of bounded degree2024-01-29Paper
Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs2024-01-29Paper
Hitting all maximum stable sets in \(P_5\)-free graphs2024-01-15Paper
List-$k$-Coloring $H$-free graphs for all $k>4$2023-11-09Paper
Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole2023-11-09Paper
Induced subgraphs and tree decompositions XIII. Basic obstructions in $\mathcal{H}$-free graphs for finite $\mathcal{H}$2023-11-08Paper
Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture2023-10-30Paper
Pure pairs. X. Tournaments and the strong Erdős-Hajnal property2023-10-25Paper
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree2023-10-06Paper
Polynomial bounds for chromatic number II: Excluding a star‐forest2023-10-05Paper
Polynomial bounds for chromatic number. III. Excluding a double star2023-10-05Paper
Polynomial bounds for chromatic number VII. Disjoint holes2023-10-05Paper
Pure pairs. V: Excluding some long subdivision2023-10-04Paper
Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path2023-10-04Paper
Induced subgraphs and tree decompositions XII. Grid theorem for pinched graphs2023-09-21Paper
Erdős–Hajnal for graphs with no 5‐hole2023-09-20Paper
Strengthening Rödl's theorem2023-09-19Paper
Induced subgraphs and tree decompositions XI. Local structure in even-hole-free graphs of large treewidth2023-09-08Paper
Induced subgraphs and tree decompositions X. Towards logarithmic treewidth for even-hole-free graphs2023-07-25Paper
Induced subgraphs and tree decompositions. IV: (Even hole, diamond, pyramid)-free graphs2023-06-27Paper
On heroes in digraphs with forbidden induced forests2023-06-07Paper
Induced subgraphs and tree decompositions IX. Grid theorem for perforated graphs2023-05-24Paper
Complexity of \(C_k\)-coloring in hereditary classes of graphs2023-05-19Paper
Pure pairs. IV: Trees in bipartite graphs2023-05-02Paper
Pure pairs. VII. Homogeneous submatrices in 0/1-matrices with a forbidden submatrix2023-05-02Paper
Polynomial bounds for chromatic number VI. Adding a four-vertex path2023-04-27Paper
On symmetric intersecting families of vectors2023-03-30Paper
The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size2023-02-21Paper
https://portal.mardi4nfdi.de/entity/Q58745042023-02-07Paper
Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs2023-01-17Paper
Induced subgraphs and tree decompositions VIII. Excluding a forest in (theta, prism)-free graphs2023-01-05Paper
The Kromatic Symmetric Function: A $K$-theoretic Analogue of $X_G$2023-01-05Paper
A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number2022-11-28Paper
Digraphs with all induced directed cycles of the same length are not \(\vec{\chi}\)-bounded2022-11-08Paper
Homogeneous Sets in Graphs and a Chromatic Multisymmetric Function2022-09-28Paper
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph2022-08-31Paper
Plethysms of chromatic and Tutte symmetric functions2022-08-04Paper
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets2022-07-12Paper
Concatenating bipartite graphs2022-06-13Paper
Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs2022-05-17Paper
https://portal.mardi4nfdi.de/entity/Q50757682022-05-11Paper
Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture2022-04-04Paper
Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs2022-03-31Paper
Polynomial bounds for chromatic number VI. Adding a four-vertex path2022-02-21Paper
Modular relations of the Tutte symmetric function2022-01-20Paper
Pure pairs. VIII. Excluding a sparse graph2022-01-11Paper
Pure Pairs VI: Excluding an Ordered Tree2022-01-07Paper
A Complete Multipartite Basis for the Chromatic Symmetric Function2021-12-01Paper
The $r$-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size2021-11-19Paper
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes2021-11-04Paper
Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth2021-09-03Paper
Pure pairs. II: Excluding all subdivisions of a graph2021-08-03Paper
A note on simplicial cliques2021-07-08Paper
Finding an induced path that is not a shortest path2021-06-14Paper
A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function2021-04-12Paper
On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture2021-03-25Paper
List 3-coloring graphs with no induced \(P_6 + rP_3\)2021-02-01Paper
Short directed cycles in bipartite digraphs2021-01-25Paper
Pure pairs. I: Trees and linear anticomplete pairs2020-12-03Paper
Disproportionate division2020-11-20Paper
Detecting an Odd Hole2020-11-11Paper
Proof of the Kalai-Meshulam conjecture2020-09-15Paper
A deletion-contraction relation for the chromatic symmetric function2020-09-15Paper
List 3-coloring \(P_t\)-free graphs with no induced 1-subdivision of \(K_{1 , s}\)2020-09-10Paper
Complexity of $C_k$-coloring in hereditary classes of graphs2020-05-04Paper
Towards Erdős-Hajnal for graphs with no 5-hole2020-01-17Paper
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes2020-01-15Paper
Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable2019-10-31Paper
Four-coloring P6-free graphs2019-10-15Paper
Entropic matroids and their representation2019-09-26Paper
\(H\)-colouring \(P_t\)-free graphs in subexponential time2019-09-05Paper
Approximately coloring graphs without long induced paths2019-06-27Paper
Caterpillars in Erdős-Hajnal2019-06-17Paper
Sandwich and probe problems for excluding paths2018-12-03Paper
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two2018-11-12Paper
The sandwich problem for decompositions and almost monotone properties2018-10-18Paper
Corrigendum to: ``Even pairs and prism corners in square-free Berge graphs2018-10-11Paper
Sparse graphs with no polynomial-sized anticomplete pairs2018-09-28Paper
List-three-coloring graphs with no induced $P_6+rP_3$2018-06-28Paper
Triangle-free graphs with no six-vertex induced path2018-06-07Paper
Piercing axis-parallel boxes2018-05-25Paper
Even pairs and prism corners in square-free Berge graphs2018-05-09Paper
Approximately coloring graphs without long induced paths2018-01-04Paper
Fast prefix adders for non-uniform input arrival times2017-03-06Paper
Colouring perfect graphs with bounded clique number2016-11-25Paper
Tree independence number I. (Even hole, diamond, pyramid)-free graphsN/APaper
On prime Cayley graphsN/APaper
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidthN/APaper
Graphs of bounded chordalityN/APaper
The sandwich problem for odd-hole-free and even-hole-free graphsN/APaper
Tree independence number II. Three-path-configurationsN/APaper

Research outcomes over time

This page was built for person: Sophie Spirkl