An explicit construction of graphs of bounded degree that are far from being Hamiltonian (Q5864726): Difference between revisions

@@ Property / OpenAlex ID @@
+W3124915618
@@ Property / OpenAlex ID: W3124915618 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05801
@@ Property / arXiv ID: 2008.05801 / rank @@
+Normal rank
@@ Property / cites work @@
+\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
+Normal rank
@@ Property / cites work @@
+Efficient testing of large graphs
@@ Property / cites work: Efficient testing of large graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
+Normal rank
@@ Property / cites work @@
+Every minor-closed property of sparse graphs is testable
+Normal rank
@@ Property / cites work @@
+An optimal construction of Hanf sentences
@@ Property / cites work: An optimal construction of Hanf sentences / rank @@
+Normal rank
@@ Property / cites work @@
+Relating two property testing models for bounded degree directed graphs
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
+Normal rank
@@ Property / cites work @@
+Q4850061
@@ Property / cites work: Q4850061 / rank @@
+Normal rank
@@ Property / cites work @@
+Every Testable (Infinite) Property of Bounded-Degree Graphs Contains an Infinite Hyperfinite Subproperty
+Normal rank
@@ Property / cites work @@
+Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
+Normal rank
@@ Property / cites work @@
+The Planar Hamiltonian Circuit Problem is NP-Complete
+Normal rank
@@ Property / cites work @@
+Introduction to Property Testing
@@ Property / cites work: Introduction to Property Testing / rank @@
+Normal rank
@@ Property / cites work @@
+A sublinear bipartiteness tester for bounded degree graphs
+Normal rank
@@ Property / cites work @@
+Property testing in bounded degree graphs
@@ Property / cites work: Property testing in bounded degree graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Proximity-Oblivious Testing
@@ Property / cites work: On Proximity-Oblivious Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Property testing and its connection to learning and approximation
+Normal rank
@@ Property / cites work @@
+Updating the hamiltonian problem—A survey
@@ Property / cites work: Updating the hamiltonian problem—A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5551141
@@ Property / cites work: Q5551141 / rank @@
+Normal rank
@@ Property / cites work @@
+Local Graph Partitions for Approximation and Testing
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Testing subdivision-freeness
@@ Property / cites work: Testing subdivision-freeness / rank @@
+Normal rank
@@ Property / cites work @@
+Random walks and forbidden minors II
@@ Property / cites work: Random walks and forbidden minors II / rank @@
+Normal rank
@@ Property / cites work @@
+Q4899293
@@ Property / cites work: Q4899293 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071451
@@ Property / cites work: Q4071451 / rank @@
+Normal rank
@@ Property / cites work @@
+Every Property of Hyperfinite Graphs Is Testable
@@ Property / cites work: Every Property of Hyperfinite Graphs Is Testable / rank @@
+Normal rank
@@ Property / cites work @@
+The hamiltonicity of swapped (OTIS) networks built of Hamiltonian component networks
+Normal rank
@@ Property / cites work @@
+On monadic NP vs monadic co-NP
@@ Property / cites work: On monadic NP vs monadic co-NP / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy waves, the zig-zag graph product, and new constant-degree expanders
+Normal rank
@@ Property / cites work @@
+Almost all regular graphs are hamiltonian
@@ Property / cites work: Almost all regular graphs are hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Characterizations of Polynomials with Applications to Program Testing
+Normal rank
@@ Property / cites work @@
+Property testing on \(k\)-vertex-connectivity of graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5864726