Short Proofs of the Kneser-Lovász Coloring Principle

Information and Computation - United States
doi 10.1016/j.ic.2018.02.010
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Very Short Primality Proofs

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1987English

Two Short Proofs of the Perfect Forest Theorem

Theory and Applications of Graphs
CombinatoricsNumerical AnalysisTheoretical Computer ScienceDiscrete Mathematics
2017English

Two Short Proofs Concerning Tree-Decompositions

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2002English

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2002English

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

1997English

The Chromatic Number of Kneser Hypergraphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1986English

The Kneser–Poulsen Conjecture for Special Contractions

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2018English

On Fast Heuristic Non-Deterministic Algorithms and Short Heuristic Proofs

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy