Digraphons: connectivity and spectral aspects
Fuente:
arXiv
Saved in:
| Main Authors: | Hladký, Jan, Savický, Petr |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Inhomogeneous random 2-SAT
by: Hladký, Jan, et al.
Published: (2025)
by: Hladký, Jan, et al.
Published: (2025)
On CNF formulas irredundant with respect to unit clause propagation
by: Savický, Petr
Published: (2023)
by: Savický, Petr
Published: (2023)
Connectivity of inhomogeneous random graphs II
by: Hladký, Jan, et al.
Published: (2023)
by: Hladký, Jan, et al.
Published: (2023)
A tower lower bound for the degree relaxation of the Regularity Lemma
by: Garbe, Frederik, et al.
Published: (2024)
by: Garbe, Frederik, et al.
Published: (2024)
Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)
by: Hladký, Jan, et al.
Published: (2023)
Hamiltonicity of inhomogeneous random graphs
by: Garbe, Frederik, et al.
Published: (2026)
by: Garbe, Frederik, et al.
Published: (2026)
On cospectral graphons
by: Hladký, Jan, et al.
Published: (2024)
by: Hladký, Jan, et al.
Published: (2024)
Graphon branching processes and fractional isomorphism
by: Hladký, Jan, et al.
Published: (2024)
by: Hladký, Jan, et al.
Published: (2024)
Limits of Latin squares
by: Garbe, Frederik, et al.
Published: (2020)
by: Garbe, Frederik, et al.
Published: (2020)
Essential connectivity and spectral radius of graphs
by: Ding, Wenxiu, et al.
Published: (2024)
by: Ding, Wenxiu, et al.
Published: (2024)
Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
by: Kabela, Adam, et al.
Published: (2024)
by: Kabela, Adam, et al.
Published: (2024)
A unified approach to the spectral radius, connectivity and edge-connectivity of graphs
by: Wang, Yu, et al.
Published: (2024)
by: Wang, Yu, et al.
Published: (2024)
On pattern-avoiding permutons
by: Garbe, Frederik, et al.
Published: (2022)
by: Garbe, Frederik, et al.
Published: (2022)
Some bounds on the spectral radius of connected threshold graphs
by: Csikvári, Péter, et al.
Published: (2024)
by: Csikvári, Péter, et al.
Published: (2024)
From flip processes to dynamical systems on graphons
by: Garbe, Frederik, et al.
Published: (2022)
by: Garbe, Frederik, et al.
Published: (2022)
Extremal spectral radius and $g$-good $r$-component connectivity
by: Ding, Wenxiu, et al.
Published: (2024)
by: Ding, Wenxiu, et al.
Published: (2024)
Prominent examples of flip processes
by: Araújo, Pedro, et al.
Published: (2022)
by: Araújo, Pedro, et al.
Published: (2022)
New Upper Bounds on the Minimal Domination Numbers of High-Dimensional Hypercubes
by: DeVivo, Zachary, et al.
Published: (2024)
by: DeVivo, Zachary, et al.
Published: (2024)
Intervals in Dyck paths and the wreath conjecture
by: Petr, Jan, et al.
Published: (2025)
by: Petr, Jan, et al.
Published: (2025)
Towards odd-sunflowers: temperate families and lightnings
by: Petr, Jan, et al.
Published: (2024)
by: Petr, Jan, et al.
Published: (2024)
Extremal distance spectral radius of graphs with $h$-extra $r$-component connectivity
by: Zhang, Daoxia, et al.
Published: (2025)
by: Zhang, Daoxia, et al.
Published: (2025)
Various spectral aspects of NCCC-graphs of certain finite non-abelian groups
by: Chakraborty, Rishabh, et al.
Published: (2025)
by: Chakraborty, Rishabh, et al.
Published: (2025)
On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)
by: Petr, Jan, et al.
Published: (2022)
The wreath matrix
by: Petr, Jan, et al.
Published: (2025)
by: Petr, Jan, et al.
Published: (2025)
Transductions of Graph Classes Admitting Product Structure
by: Hliněný, Petr, et al.
Published: (2025)
by: Hliněný, Petr, et al.
Published: (2025)
Enumerative aspects of Caylerian polynomials
by: Cerbai, Giulio, et al.
Published: (2024)
by: Cerbai, Giulio, et al.
Published: (2024)
Enumerating k-connected blocks and gk-connected blocks in words
by: Asakly, Walaa, et al.
Published: (2025)
by: Asakly, Walaa, et al.
Published: (2025)
4-connected 1-planar chordal graphs are Hamiltonian-connected
by: Zhang, Licheng, et al.
Published: (2024)
by: Zhang, Licheng, et al.
Published: (2024)
Non-existence of co-spectral simple connected graphs with small number of edges
by: Boyko, O., et al.
Published: (2025)
by: Boyko, O., et al.
Published: (2025)
k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)
by: Hliněný, Petr, et al.
Published: (2025)
Hereditary Graph Product Structure and $\cal H$-clique-width
by: Hliněný, Petr, et al.
Published: (2024)
by: Hliněný, Petr, et al.
Published: (2024)
On connected graphs with finite spectral redundancy index and Pythagorean triplets
by: Kumar, Pawan, et al.
Published: (2025)
by: Kumar, Pawan, et al.
Published: (2025)
Cages and cyclic connectivity
by: Lukoťka, Robert, et al.
Published: (2025)
by: Lukoťka, Robert, et al.
Published: (2025)
On the connected coalition number
by: Guan, Xiaxia, et al.
Published: (2024)
by: Guan, Xiaxia, et al.
Published: (2024)
Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
by: Yang, Qing, et al.
Published: (2022)
by: Yang, Qing, et al.
Published: (2022)
On 13-Crossing-Critical Graphs with Arbitrarily Large Degrees
by: Hliněný, Petr, et al.
Published: (2021)
by: Hliněný, Petr, et al.
Published: (2021)
On the maximum spectral radius of connected graphs with a prescribed order and size
by: Damnjanović, Ivan
Published: (2025)
by: Damnjanović, Ivan
Published: (2025)
The spectral Turán problem: Characterizing spectral-consistent graphs
by: Fang, Longfei, et al.
Published: (2025)
by: Fang, Longfei, et al.
Published: (2025)
Monochromatic $k$-connection of graphs
by: Cai, Qingqiong, et al.
Published: (2024)
by: Cai, Qingqiong, et al.
Published: (2024)
On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code
by: Klimov, Petr
Published: (2026)
by: Klimov, Petr
Published: (2026)
Similar Items
-
Inhomogeneous random 2-SAT
by: Hladký, Jan, et al.
Published: (2025) -
On CNF formulas irredundant with respect to unit clause propagation
by: Savický, Petr
Published: (2023) -
Connectivity of inhomogeneous random graphs II
by: Hladký, Jan, et al.
Published: (2023) -
A tower lower bound for the degree relaxation of the Regularity Lemma
by: Garbe, Frederik, et al.
Published: (2024) -
Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)