No article text was recorded for this version.
extremal bound gap
Version 1 of 143 papers60 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
- Blog: Regarding Two Conjectures on Clique and Biclique Partitions
- Blog: RADIUS OF 3-CONNECTED GRAPHS
- Blog: A bound on the number of perfect matchings in Klee-graphs
- Blog: The Number of Minimum k-Cuts: Improving the Karger-Stein Bound
- Blog: Broadcast domination and multipacking: bounds and the integrality gap
- Blog: Edge-statistics on large graphs
- Blog: Disjoint edges in geometric graphs
- Blog: Large Subgraphs without Short Cycles
- Blog: Permutation Tutte polynomial
- Blog: The Hosoya index and the Merrifield–Simmons index
- Blog: Beyond-Planar Graphs: Algorithmics and Combinatorics (Dagstuhl Seminar 16452)
- Blog: Generalized Orthogonal de Bruijn Sequences
- Blog: Homometric sets in trees
- Blog: The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
- Blog: Finding Cliques in Social Networks: A New Distribution-Free Model
- Blog: Fully Computer-Assisted Proofs in Extremal Combinatorics
- Blog: Impact of interference on multi-hop wireless network performance
- Blog: Universality for graphs with bounded density
- Blog: On the Turán Number of the Linear $3$-Graph $C_{13}$
- Blog: Formalizing Graph Trail Properties in Isabelle/HOL
- Blog: On Adaptivity Gaps of Influence Maximization Under the Independent Cascade Model with Full-Adoption Feedback
- Blog: Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
- Blog: Nearly complete graphs decomposable into large induced matchings and their applications
- Blog: Signed Cycle Double Covers
- Blog: The Rique-Number of Graphs
- Blog: Gap-planar Graphs
- Blog: Distance-based (and path-based) covering problems for graphs of given cyclomatic number
- Blog: Large Low-Diameter Graphs are Good Expanders
- Blog: Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback
- Blog: Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
- Blog: The Lovász number of random circulant graphs
- Blog: New Ramsey Multiplicity Bounds and Search Heuristics
- Blog: Approximating Bin Packing with Conflict Graphs via Maximization Techniques
- Blog: Min-k-planar Drawings of Graphs
- Blog: Homomorphisms of Edge-Colored Graphs and Coxeter Groups
- Blog: Group Testing With Correlation Under Edge-Faulty Graphs
- Blog: Locally identifying colourings for graphs with given maximum degree
- Blog: Domination and location in twin-free digraphs
- Blog: Circular Coloring and Mycielski Construction
- Blog: Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs
- Blog: Short Certificates for Tournaments
- Blog: Turán graphs with bounded matching number
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_extremal_bound_gap_b50df87a,
title = {extremal bound gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/extremal-bound-gap/rdr_b50df87a239642debbf823217b8bd260},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_extremal_bound_gap_b50df87a_v1,
title = {extremal bound gap},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/extremal-bound-gap/rdr_b50df87a239642debbf823217b8bd260/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}