Cover Image

Krenn-Gu conjecture for sparse graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chandran, L. Sunil, Gajjala, Rishikesh, Illickan, Abraham M.
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Graph-theoretic insights on the constructability of complex entangled states
by: Chandran, L. Sunil, et al.
Published: (2023)

Counterexamples to an Extremal Conjecture for Random Cycle-Factors
by: Gajjala, Rishikesh
Published: (2026)

CNFs and DNFs with Exactly $k$ Solutions
by: Chandran, L. Sunil, et al.
Published: (2025)

Improved upper bounds for the Heilbronn's Problem for $k$-gons
by: Gajjala, Rishikesh, et al.
Published: (2024)

Face-hitting Dominating Sets in Planar Graphs
by: Francis, P., et al.
Published: (2024)

Maximal Independent Sets in Planar Triangulations
by: Francis, P., et al.
Published: (2024)

Localization: A Framework to Generalize Extremal Graph Problems
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Generalized Turán Problems
by: Adak, Rajat, et al.
Published: (2025)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

Preparing graph states forbidding a vertex-minor
by: Davies, James, et al.
Published: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
by: Farhi, Edward, et al.
Published: (2025)

Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)

Off-diagonal Rado number for $x+y+c=z$ and $x+qy=z$
by: Adak, Rajat, et al.
Published: (2026)

Canonical labelling of sparse random graphs
by: Verbitsky, Oleg, et al.
Published: (2024)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

W-state graphs: Structure and Algorithms
by: Gajjala, Rishikesh, et al.
Published: (2026)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)

Sample compression schemes for balls in structurally sparse graphs
by: Bourneuf, Romain, et al.
Published: (2026)

The 1/3-conjectures for domination in cubic graphs
by: Dorbec, Paul, et al.
Published: (2024)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide
by: Ghasemi, Fatemeh, et al.
Published: (2025)

Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
by: Mohan, Amulya, et al.
Published: (2024)

Simple Quantum Coins Enable Pretty Good State Transfer on Every Hypercube
by: Zhan, Hanmeng
Published: (2024)

Random sampling of permutations through quantum circuits
by: Adhikari, Bibhas
Published: (2024)

$ε$-Uniform Mixing in Discrete Quantum Walks
by: Zhan, Hanmeng
Published: (2023)

Sunflowers and Ramsey problems for restricted intersections
by: Janzer, Barnabás, et al.
Published: (2025)

Perfect state transfer using Markovian quantum walk
by: Dutta, Supriyo
Published: (2022)

Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant Viewpoint
by: Cai, Jin-Yi, et al.
Published: (2022)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
by: Dailly, Antoine, et al.
Published: (2018)

Minimum stationary values of sparse random directed graphs
by: Cai, Xing Shi, et al.
Published: (2020)

Edge coloring lattice graphs
by: Kattemölle, Joris
Published: (2024)

Toward Vu's conjecture
by: Bradshaw, Peter, et al.
Published: (2025)

An analogue of Reed's conjecture for digraphs
by: Kawarabayashi, Ken-ichi, et al.
Published: (2024)

First order distinguishability of sparse random graphs
by: Hershko, Tal, et al.
Published: (2024)

On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)