A fixed-parameter algorithm for the Schrijver problem

DOI10.4230/LIPICS.IPEC.2022.16MaRDI QIDQ6968996zbMATH OpenFDO

Authors Ishay Haviv

Publication date 23 June 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.IPEC.2022.16

zbMATH Keywords

fixed-parameter tractabilityKneser graphSchrijver graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Cites work

• A fixed-parameter algorithm for the Kneser problem
• A Moment Problem in L 1 Approximation
• A short proof of Kneser's conjecture
• Computing a small agreeable set of indivisible items
• Consensus halving for sets of items
• Consensus halving is PPA-complete
• Consensus-halving via theorems of Borsuk-Ulam and Tucker
• Constant inapproximability for PPA
• Drei Sätze über die n-dimensionale euklidische Sphäre
• scientific article; zbMATH DE number 3121295 (Why is no real title available?)
• scientific article; zbMATH DE number 3672329 (Why is no real title available?)
• scientific article; zbMATH DE number 1246230 (Why is no real title available?)
• scientific article; zbMATH DE number 7788493 (Why is no real title available?)
• INTERSECTING FAMILIES OF SEPARATED SETS
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Kernelization. Theory of parameterized preprocessing
• Kneser's conjecture, chromatic number, and homotopy
• On the complexity of the parity argument and other inefficient proofs of existence
• On total functions, existence theorems and computational complexity
• Parameterized algorithms
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The complexity of splitting necklaces and bisecting ham sandwiches

This page was built for publication: A fixed-parameter algorithm for the Schrijver problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968996)