Results 21 to 30 of about 92,199 (230)
Large girth approximate Steiner triple systems [PDF]
Journal of the London Mathematical Society, 2018 In 1973, Erdős asked whether there are n ‐vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g⩾4 for which some g ‐element vertex‐set contains at least g−2 ...
T. Bohman, L. Warnke
semanticscholar +1 more source
Lower Bounds on the Lifting Degree of QC-LDPC Codes by Difference Matrices
IEEE Access, 2018 In this paper, we define two “difference matrices” which correspond to an exponent matrix. We present necessary and sufficient conditions for these difference matrices to have quasi-cyclic low-density parity-check codes (QC-LDPC) codes with
Farzane Amirzade, Mohammad-Reza Sadeghi
doaj +1 more source
Acyclic edge coloring of planar graphs
AIMS Mathematics, 2022 An acyclic edge coloring of a graph $ G $ is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of $ G $, denoted by $ \chi^{'}_{a}(G) $, is the smallest integer $ k $ such that $ G $ is acyclically edge $ k $
Yuehua Bu +3 more
doaj +1 more source
Asymptotics in percolation on high‐girth expanders [PDF]
Random Struct. Algorithms, 2018 We consider supercritical bond percolation on a family of high‐girth d ‐regular expanders. The previous study of Alon, Benjamini and Stacey established that its critical probability for the appearance of a linear‐sized (“giant”) component is pc=1/(d−1) .
Michael Krivelevich +2 more
semanticscholar +1 more source
Characterization of classes of graphs with large general position number
AKCE International Journal of Graphs and Combinatorics, 2020 Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows.
Elias John Thomas, Ullas Chandran S. V.
doaj +1 more source
Scientia Agricola, 2007 Rubber tree cultivation [Hevea brasiliensis (Willd. ex Adr. de Juss.) Muell.-Arg.] uses mostly the budding propagation method, however the expected stand uniformity due to the use of vegetative propagation is theoretical, since high variation for yield ...
Átila Bento Beleti Cardinal +2 more
doaj +1 more source
Unified bijections for maps with prescribed degrees and girth [PDF]
, 2012 This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively the general ...
Bernardi, Olivier, Fusy, Eric
core +2 more sources
Modèle de croissance pour les plantations de mélèzes [PDF]
Biotechnologie, Agronomie, Société et Environnement, 2003 Growth model forlarch in pure and even-aged stands. Adistance independent tree growth model has been determined forpure and even-aged larch stands (Larix sp.) growing in Walloon Region (South Belgium).
Rondeux J., Lejeune P., Pauwels D.
doaj
On Some Properties of Antipodal Partial Cubes
Discussiones Mathematicae Graph Theory, 2020 We prove that an antipodal bipartite graph is a partial cube if and only it is interval monotone. Several characterizations of the principal cycles of an antipodal partial cube are given.
Polat Norbert
doaj +1 more source
Exhaustive generation of $k$-critical $\mathcal H$-free graphs [PDF]
, 2015 We describe an algorithm for generating all $k$-critical $\mathcal H$-free graphs, based on a method of Ho\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$ and $k=5$.
B Randerath +17 more
core +1 more source