No article text was recorded for this version.
proof by contradiction
Version 1 of 135 papers46 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Trisimplicial vertices in (fork, odd parachute)-free graphs
- Blog: Circular chromatic index of graphs of maximum degree 3
- Blog: The Extremal Function and Colin de Verdière Graph Parameter
- Blog: Sufficient conditions for the existence of path-factors with given properties
- Blog: Critical (P5, bull)-free graphs
- Blog: Borodin-Kostochka Conjecture Holds for Odd-Hole-Free Graphs
- Blog: Edge-colouring seven-regular planar graphs
- Blog: The Extremal Function for Bipartite Linklessly Embeddable Graphs
- Blog: Cycle Extendability of Hamiltonian Strongly Chordal Graphs
- Blog: Note on Cyclically Interval Edge Colorings of Simple Cycles
- Blog: Large Induced Acyclic and Outerplanar Subgraphs of 2-Outerplanar Graph
- Blog: A note on the P3-isolation number of a graph
- Blog: A characterization of rich c-partite (c > 7) tournaments without (c + 2)-cycles
- Blog: Power domination in regular claw-free graphs
- Blog: Large induced forests in sparse graphs
- Blog: Further Progress on the GM-MDS Conjecture for Reed-Solomon Codes
- Blog: Generalized Power Domination in Claw-Free Regular Graphs
- Blog: Packing six T-joins in plane graphs
- Blog: Independence number and clique minors
- Blog: More powerful closure operations on graphs
- Blog: Nonexistence of Triples of Nonisomorphic Connected Graphs with Isomorphic Connected P3-graphs
- Blog: Tournaments and the strong Erdős-Hajnal Property
- Blog: Contagious sets in dense graphs
- Blog: Lions and contamination: Monotone clearings
- Blog: On some path-critical Ramsey numbers
- Blog: On the Erdős-Hajnal conjecture for six-vertex tournaments
- Blog: Removable cycles in non-bipartite graphs
- Blog: 7-Connected graphs are 4-ordered
- Blog: Asymptotic complements in the integers
- Blog: The Kelmans-Seymour conjecture I: Special separations
- Blog: The Erdös-Lovász Tihany conjecture and complete minors
- Blog: A SAT Attack on Rota's Basis Conjecture
- Blog: The Kelmans-Seymour conjecture IV: A proof
- Blog: Immersing small complete graphs
- Blog: Vertex-disjoint cycles containing specified edges in a bipartite graph
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_proof_by_contradiction_c1f93cfa,
title = {proof by contradiction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/proof-by-contradiction/rdr_c1f93cfafc6a456296e1f9aa1f82e3d6},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_proof_by_contradiction_c1f93cfa_v1,
title = {proof by contradiction},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/proof-by-contradiction/rdr_c1f93cfafc6a456296e1f9aa1f82e3d6/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}