Pierre Aboulker

Author (arXiv only) · 56 problems

Title	Source	Status	Posted
FPT approximation for tournament forest-ordering	arxiv	open	2026-01-23
Complexity of C-FAS for paths and matchings	arxiv	open	2026-01-23
Subcubic H-ISC planarity dichotomy	arxiv	open	2025-02-07
Complexity gap between induced disjoint paths variants	arxiv	open	2025-02-07
Polynomial unavoidability in bounded average degree digraphs	arxiv	open	2024-10-31
Blow-up closure of linear unavoidability	arxiv	partial	2024-10-31
Optimal constant for tree blow-up unavoidability	arxiv	open	2024-10-31
Bounded unvd ratio under vertex deletion	arxiv	open	2024-10-31
Exponential unavoidability of tree k-extensions	arxiv	open	2024-10-31
k-extensions preserve linear unavoidability	arxiv	open	2024-10-31
Unavoidability rate of k-extensions in tournaments	arxiv	open	2024-10-31
Acyclic number Θ(√(n log n)) oriented triangle-free	arxiv	open	2024-03-04
Maximum dichromatic number of oriented triangle-free graphs	arxiv	open	2024-03-04
Δ(1,2,2) hero in oriented complete multipartite graphs	arxiv	disproved	2023-12-11
Δ(1,1,H) hero transfer under K₁+F	arxiv	open	2023-12-11
Simultaneous ω-ordering and χ-ordering in tournaments	arxiv	unclear	2023-10-06
Polynomial dichromatic boundedness under substitution closure	arxiv	open	2023-10-06
χ̄-boundedness for bounded twin-width tournaments	arxiv	open	2023-10-06
→χ-bounding ordering for bounded-twin-width tournaments	arxiv	unclear	2023-10-06
BST-ordering bound for tournament clique number	arxiv	unclear	2023-10-06
χ⃗-binding tournaments with forest backedge graphs	arxiv	open	2023-10-06
χ-boundedness of matchings in ordered graphs	arxiv	open	2023-10-06
Large dom implies ω̄-cluster in tournaments	arxiv	solved	2023-10-06
Local clique number bounds global in tournaments	arxiv	unclear	2023-10-06
Bounded-size ω→-witness subtournament	arxiv	partial	2023-10-06
Infinitely Many k-ω-critical Tournaments	arxiv	unclear	2023-10-06
χ̄-boundedness closed under substitution	arxiv	open	2023-10-06
2-extremal digraph characterization via χ and λ	arxiv	open	2023-09-13
Dichromatic construction size in C₃	arxiv	open	2022-02-02
Complexity of Σ-k-dicolourability k∈{4,5}	arxiv	open	2021-11-16
Heroic sets for bounded dichromatic number	arxiv	partial	2020-09-28
Heroic triple characterization via transitive tournaments	arxiv	partial	2020-09-28
Heroic triple with oriented forest and K_k	arxiv	partial	2020-09-28
Minimal heroic tournament set classification	arxiv	open	2020-09-28
Bounded-degree even-hole-free tree-width	arxiv	solved	2020-08-12
Induced wall in bounded-degree high tree-width graphs	arxiv	solved	2020-08-12
FPT on H_{t,t}-free graphs for Grundy Coloring	arxiv	open	2020-01-11
Grundy Coloring FPT on K_{t,t}-free graphs	arxiv	solved	2020-01-11
Parameterized complexity of Partial Grundy Coloring	arxiv	solved	2020-01-11
Sublinear round complexity for distributed coloring	arxiv	open	2018-12-19
Randomized round complexity of Δ-list-coloring	arxiv	open	2018-12-19
Treewidth-exponential extension complexity for correlation polytopes	arxiv	open	2018-10-18
Erdős–Pósa O(k log k) bound for planar H-minors	arxiv	solved	2018-07-05
Treewidth packing with k log k bound	arxiv	open	2018-07-05
k-coloring complexity for maximally locally connected graphs	arxiv	open	2016-10-14
TT_k Subdivision via Minimum Semidegree	arxiv	open	2016-10-04
δ⁺-Maderian property for oriented trees	arxiv	open	2016-10-04
Closure of δ⁺-maderian digraphs under disjoint union	arxiv	open	2016-10-04
χ-Mader bound for oriented trees	arxiv	solved	2016-10-04
Exact value of mader_χ̄(K̄ₙ)	arxiv	open	2016-10-04
κ-maderianness of strongly connected digraphs	arxiv	partial	2016-10-04
Finite exceptions to ℓ(G)+br(G)≥\|G\|	arxiv	open	2016-06-20
Bridge path-elongation structure of ℓ(G)+br(G) counterexamples	arxiv	open	2016-06-20
Forb(H) χ-bounded iff H is forest	arxiv	partial	2016-05-24
χ-boundedness of oriented-star-free classes	arxiv	partial	2016-05-24
χ-boundedness of P₄-orientation forbiddance classes	arxiv	solved	2016-05-24