Results 41 to 50 of about 789,258 (121)

The complexity of the perfect matching‐cut problem

open access: yesJournal of Graph Theory, Volume 108, Issue 3, Page 432-462, March 2025.
Abstract PERFECT MATCHING‐CUT is the problem of deciding whether a graph has a perfect matching that contains an edge‐cut. We show that this problem is NP‐complete for planar graphs with maximum degree four, for planar graphs with girth five, for bipartite five‐regular graphs, for graphs of diameter three, and for bipartite graphs of diameter four.
Valentin Bouquet, Christophe Picouleau
wiley   +1 more source

Logarithmic girth expander graphs of $SL_n(\mathbb F_p)$ [PDF]

open access: yes, 2018
We provide an explicit construction of finite 4-regular graphs $(\Gamma_k)_{k\in \mathbb N}$ with ${girth \Gamma_k\to\infty}$ as $k\to\infty$ and $\frac{diam \Gamma_k}{girth \Gamma_k}\leqslant D$ for some $D>0$ and all $k\in\mathbb{N}$. For each fixed dimension $n\geqslant 2,$ we find a pair of matrices in $SL_{n}(\mathbb{Z})$ such that (i) they ...
arxiv   +1 more source

A cross‐cultural replication of “citizens' blame of politicians for public service failure: Experimental evidence about blame reduction through delegation and contracting”

open access: yesPublic Administration Review, Volume 85, Issue 2, Page 436-450, March/April 2025.
Abstract Theories of blame suggest that the institutional design of public service delivery affects citizens' blame of politicians for service failure, and that delegation or contracting out reducing citizens' blame of politicians. We replicate experimentally James et al.'s blame study to assess whether the findings still apply in the original, Western
Richard M. Walker   +3 more
wiley   +1 more source

Higher dimensional Moore bounds [PDF]

open access: yesarXiv, 2009
We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.
arxiv  

Necessary and Sufficient Girth Conditions for Tanner Graphs of Quasi-Cyclic LDPC Codes [PDF]

open access: yesarXiv, 2021
This paper revisits the connection between the girth of a protograph-based LDPC code given by a parity-check matrix and the properties of powers of the product between the matrix and its transpose in order to obtain the necessary and sufficient conditions for a code to have given girth between 6 and 12, and to show how these conditions can be ...
arxiv  

Aligning Fishing Gear Selectivity With Harvest Slot Limits for Ballan Wrasse Labrus bergylta

open access: yesAquaculture, Fish and Fisheries, Volume 5, Issue 1, February 2025.
ABSTRACT Selectivity is an important parameter used to identify the portion of a stock caught by a fishing gear. In principle, fisheries management aligns the length at which 50% of individuals are selected for (L50${L_{50}}$) with minimum landing sizes.
Calum J. Pritchard   +7 more
wiley   +1 more source

The girth alternative for mapping class groups [PDF]

open access: yesarXiv, 2011
The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable surface. Then, either G is virtually abelian or it has infinite girth; moreover, if we assume that G is not infinite ...
arxiv  

Analysis Of The Girth For Regular Bi-partite Graphs With Degree 3 [PDF]

open access: yes, 2013
The goal of this paper is to derive the detailed description of the Enumeration Based Search Algorithm from the high level description provided in [16], analyze the experimental results from our implementation of the Enumeration Based Search Algorithm ...
Nittoor, Vivek S, Suda, Reiji
core  

Short rainbow cycles for families of matchings and triangles

open access: yesJournal of Graph Theory, Volume 108, Issue 2, Page 325-336, February 2025.
Abstract A generalization of the famous Caccetta–Häggkvist conjecture, suggested by Aharoni, is that any family F =(F 1 , … , F n ) ${\rm{ {\mathcal F} }}=({F}_{1},\ldots ,{F}_{n})$ of sets of edges in K n ${K}_{n}$, each of size k $k$, has a rainbow cycle of length at most ⌈ n k ⌉ $\lceil \frac{n}{k}\rceil $. In works by the author with Aharoni and by
He Guo
wiley   +1 more source

Unlocking the Power of Gene Banks: Diversity in Base Growth Temperature Provides Opportunities for Climate‐Smart Agriculture

open access: yesFood and Energy Security, Volume 14, Issue 1, January/February 2025.
Diversity safely conserved within gene banks, play a pivotal role in climate‐smart agriculture by recommending accessions for breeding or by distributing and introducing the varieties that possess advantages for local conditions. Screening for sufficient crop diversity in specific agro‐ecological zones will allow to mitigate the risk of climate change.
Clara Gambart   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy