Results 31 to 40 of about 789,258 (121)
A Unifying Framework to Construct QC-LDPC Tanner Graphs of Desired Girth [PDF]
arXiv, 2021 This paper presents a unifying framework to construct low-density parity-check (LDPC) codes with associated Tanner graphs of desired girth. Towards this goal, we highlight the role that a certain square matrix that appears in the product of the parity-check matrix with its transpose has in the construction of codes with graphs of desired girth and ...
arxiv
D-colorable digraphs with large girth [PDF]
, 2011 In 1959 Paul Erdos (Graph theory and probability, Canad. J. Math. 11 (1959), 34-38) famously proved, nonconstructively, that there exist graphs that have both arbitrarily large girth and arbitrarily large chromatic number.
Rafferty, Liam
core +1 more source
Perception Pending: What Do Patents Signal to Consumers?
Journal of Empirical Legal Studies, EarlyView.ABSTRACT Patent law encourages inventors to label their products as “patented,” to mark their legal status and potentially secure monetary damages from infringing competitors. We examine whether such labels might have a separate and direct impact on consumers, by affecting how they view patented products and influencing what they purchase.
Alexander Billy, Neel Sukhatme
wiley +1 more source
Lower Bounds for the Cop Number When the Robber is Fast
, 2011 We consider a variant of the Cops and Robbers game where the robber can move t edges at a time, and show that in this variant, the cop number of a d-regular graph with girth larger than 2t+2 is Omega(d^t). By the known upper bounds on the order of cages,
ABBAS MEHRABIAN +5 more
core +1 more source
Balanced Independent Sets and Colorings of Hypergraphs
Journal of Graph Theory, Volume 109, Issue 1, Page 43-51, May 2025.ABSTRACT A k ‐uniform hypergraph H = ( V , E )
wiley +1 more source
Eigenvalues of Relatively Prime Graphs Connected with Finite Quasigroups
Journal of MathematicsA relatively new and rapidly expanding area of mathematics research is the study of graphs’ spectral properties. Spectral graph theory plays a very important role in understanding certifiable applications such as cryptography, combinatorial design, and ...
Muhammad Nadeem +5 more
doaj +1 more source
DEN Open, Volume 5, Issue 1, April 2025.Abstract Objectives Endoscopic closures of mucosal defects following endoscopic resection can be challenging and time‐consuming. The novel through‐the‐scope suture device has demonstrated acceptable closure times, but its learning curve is still unknown.
Mamoru Ito +6 more
wiley +1 more source
Small Complete Minors Above the Extremal Edge Density [PDF]
, 2012 A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader's result by replacing the notion of high
Shapira, Asaf, Sudakov, Benny
core
Odd chromatic number of graph classes
Journal of Graph Theory, Volume 108, Issue 4, Page 722-744, April 2025.Abstract A graph is called odd (respectively, even) if every vertex has odd (respectively, even) degree. Gallai proved that every graph can be partitioned into two even induced subgraphs, or into an odd and an even induced subgraph. We refer to a partition into odd subgraphs as an odd colouring of G $G$.
Rémy Belmonte +3 more
wiley +1 more source
Deterministic Constructions for Large Girth Protograph LDPC Codes
, 2013 The bit-error threshold of the standard ensemble of Low Density Parity Check (LDPC) codes is known to be close to capacity, if there is a non-zero fraction of degree-two bit nodes.
Pradhan, Asit Kumar +2 more
core +1 more source