Image de couverture de livre

A Minimum Counterexample Proof of the Seymour Second Neighborhood Conjecture via the Graph Level Order

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Glover, Charles N.
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Palette Sparsification for Graphs with Sparse Neighborhoods
par: Dhawan, Abhishek
Publié: (2024)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
par: Chen, Yu, et autres
Publié: (2024)

Matroid Intersection under Minimum Rank Oracle
par: Bárász, Mihály, et autres
Publié: (2024)

A Unified View of Graph Regularity via Matrix Decompositions
par: Bodwin, Greg, et autres
Publié: (2019)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
par: Shakeri, Heman, et autres
Publié: (2025)

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches
par: Naik, Ranjan N
Publié: (2025)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

An Easy Proof of a Weak Version of Chernoff inequality
par: Har-Peled, Sariel
Publié: (2025)

Fast Rational Search via Stern-Brocot Tree
par: Weyers, Connor, et autres
Publié: (2025)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

A Maximum Linear Arrangement Problem on Directed Graphs
par: DeVos, Matt, et autres
Publié: (2018)

Random Generation of Git Graphs
par: Courtiel, Julien, et autres
Publié: (2024)

A Freeable Matrix Characterization of Bipartite Graphs of Ferrers Dimension Three
par: Chalermsook, Parinya, et autres
Publié: (2025)

Distance Reconstruction of Sparse Random Graphs
par: Bastide, Paul
Publié: (2024)

An Improved Bound for the Beck-Fiala Conjecture
par: Bansal, Nikhil, et autres
Publié: (2025)

Sparsifying Cayley Graphs on Every Group
par: Hsieh, Jun-Ting, et autres
Publié: (2025)

Triangle-Covered Graphs: Algorithms, Complexity, and Structure
par: Madani, Amirali, et autres
Publié: (2025)

Paths and Intersections: Exact Emulators for Planar Graphs
par: Li, George Z., et autres
Publié: (2025)

Graph parameters that are coarsely equivalent to tree-length
par: Dragan, Feodor F.
Publié: (2025)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
par: Mu, Ta-Yu, et autres
Publié: (2024)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
par: Biedl, Therese, et autres
Publié: (2024)

On Geometric Bipartite Graphs with Asymptotically Smallest Zarankiewicz Numbers
par: Chalermsook, Parinya, et autres
Publié: (2025)

Characterization of Circular-arc Graphs: II. McConnell Flipping
par: Cao, Yixin, et autres
Publié: (2024)

Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations
par: Hathcock, Daniel, et autres
Publié: (2025)

Efficient Algorithms for Partitioning Circulant Graphs with Optimal Spectral Approximation
par: Gavva, Surya Teja, et autres
Publié: (2025)

Fast and Simple $(1+ε)Δ$-Edge-Coloring of Dense Graphs
par: Dhawan, Abhishek
Publié: (2024)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
par: Aubian, Guillaume, et autres
Publié: (2025)

A faster algorithm for Vertex Cover parameterized by solution size
par: Harris, David G., et autres
Publié: (2022)

Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

An Alternate Proof of Near-Optimal Light Spanners
par: Bodwin, Greg
Publié: (2023)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
par: Kita, Nanano
Publié: (2025)

On Circular Threshold Words and Other Stronger Versions of Dejean's conjecture
par: Tunev, Igor N.
Publié: (2025)

Connected Partitions via Connected Dominating Sets
par: Niklanovits, Aikaterini, et autres
Publié: (2025)

Improved space-time tradeoff for TSP via extremal set systems
par: Dallant, Justin, et autres
Publié: (2026)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
par: Scheinerman, Danny
Publié: (2024)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
par: Chen, Yeyuan
Publié: (2024)

A Note on Generic Tangle Algorithms
par: Elbracht, Christian, et autres
Publié: (2020)

A Combinatorial Characterization of Constant Mixing Time
par: Lau, Lap Chi, et autres
Publié: (2025)

A note on Ordered Ruzsa-Szemerédi graphs
par: Pratt, Kevin
Publié: (2025)

A Lower Bound for the Max Entropy Algorithm for TSP
par: Jin, Billy, et autres
Publié: (2023)