On the most reliable graphs with fixed redundancy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brand, Rotem, Cohen, Reuven, Haber, Simi, Barzel, Baruch
Format:	Preprint
Published:	2026
Subjects:	Combinatorics Discrete Mathematics 05C40 05C35 05C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sparse Sets in Triangle-free Graphs
by: Ekim, Tınaz, et al.
Published: (2024)

Short rainbow cycles for families of small edge sets
by: Guo, He
Published: (2025)

Short rainbow cycles for families of matchings and triangles
by: Guo, He
Published: (2022)

Isolation of squares in graphs
by: Bartolo, Karl, et al.
Published: (2023)

On extremal factors of de Bruijn-like graphs
by: Álvarez, Nicolás, et al.
Published: (2023)

The connectivity dimension of a graph
by: Gottwald, Kurt Klement, et al.
Published: (2025)

Proof of a conjecture on isolation of graphs dominated by a vertex
by: Borg, Peter
Published: (2024)

Proof of a conjecture on isolation of graphs with a universal vertex
by: Borg, Peter, et al.
Published: (2025)

Regular $K_3$-regular graphs
by: Hak, Artem, et al.
Published: (2026)

Isolation of non-triangle cycles in graphs
by: Borg, Peter, et al.
Published: (2025)

Sidorenko-Type Inequalities for Pairs of Trees
by: Behague, Natalie, et al.
Published: (2023)

Dominated balanced separators in wheel-induced-minor-free graphs
by: Chudnovsky, Maria, et al.
Published: (2025)

Isolation of regular graphs and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets
by: Enami, Kengo, et al.
Published: (2025)

Isolation of regular graphs, stars and $k$-chromatic graphs
by: Borg, Peter
Published: (2023)

On an Erdős--Lov'asz problem: 3-critical 3-graphs of minimum degree 7
by: Li, Ruiliang
Published: (2025)

Solution to a problem of Katona on counting cliques of weighted graphs
by: Borg, Peter, et al.
Published: (2022)

Dominion of some graphs
by: Allagan, Julian, et al.
Published: (2025)

Rainbow cycles for families of matchings
by: Aharoni, Ron, et al.
Published: (2021)

Twin-width of random graphs
by: Ahn, Jungho, et al.
Published: (2022)

Disconnected Cliques in Derangement Graphs
by: Anderson, Sara, et al.
Published: (2024)

Exploring the space of graphs with fixed discrete curvatures
by: Roost, Michelle, et al.
Published: (2024)

Twin-width of subdivisions of multigraphs
by: Ahn, Jungho, et al.
Published: (2023)

Minimally tough series-parallel graphs with toughness at least $1/2$
by: Katona, Gyula Y., et al.
Published: (2025)

Isolation critical graphs under multiple edge subdivision
by: Bartolo, Karl, et al.
Published: (2026)

Signed double Roman domination on cubic graphs
by: Iurlano, Enrico, et al.
Published: (2023)

Graphs with unique Grundy dominating sets
by: Brešar, Boštjan, et al.
Published: (2021)

Eccentric Connectivity Index of Strongly Connected Digraphs
by: Chakooth, Vysakh, et al.
Published: (2025)

Cycles of weight divisible by $k$
by: Diwan, Ajit A.
Published: (2024)

Solution to a problem on isolation of $3$-vertex paths
by: Bartolo, Karl, et al.
Published: (2025)

The degree-diameter problem for plane graphs with pentagonal faces
by: Preez, Brandon Du
Published: (2024)

Optimally reconnecting graphs against an edge-destroying adversary
by: McDonald, Daniel C.
Published: (2021)

Closeness Centralities of Lollipop Graphs
by: Dangalchev, Chavdar
Published: (2023)

Minimal toughness in subclasses of weakly chordal graphs
by: Gollin, J. Pascal, et al.
Published: (2026)

Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
by: Allagan, Julian
Published: (2026)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Spanning caterpillar in biconvex bipartite graphs
by: Antony, Dhanyamol, et al.
Published: (2023)

Solution to a problem on isolation of cliques in uniform hypergraphs
by: Borg, Peter
Published: (2025)

Triangle-free graphs with the fewest independent sets
by: Buys, Pjotr, et al.
Published: (2025)

Functionality of Random Graphs
by: Sylvester, John, et al.
Published: (2024)