Results 51 to 60 of about 98,914 (270)
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
ABSTRACT The Oberwolfach problem OP ( F ) $\mathrm{OP}(F)$, for a 2‐factor F $F$ of K n ${K}_{n}$, asks whether there exists a 2‐factorization of K n ${K}_{n}$ (if n $n$ is odd) or K n − I ${K}_{n}-I$ (if n $n$ is even) where each 2‐factor is isomorphic to F $F$. Here, I $I$ denotes any 1‐factor of K n ${K}_{n}$. For even n $n$, the problem OP( F ) $(F)
Maruša Lekše, Mateja Šajna
wiley +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin +3 more
wiley +1 more source
Evolving from ethnographic research that determines what meanings are shared within a culture, studies regarding Speech Codes Theory have been conducted with implications for intercultural communication.
Feihong Gai, Lianrui Yang, Shifa Chen
doaj +1 more source
Signed Projective Cubes, a Homomorphism Point of View
ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Parameter estimators of random intersection graphs with thinned communities
This paper studies a statistical network model generated by a large number of randomly sized overlapping communities, where any pair of nodes sharing a community is linked with probability $q$ via the community.
A Frieze +16 more
core +1 more source
A Coarse Geometric Approach to Graph Layout Problems
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
Is Transitivity Register-specific? A Corpus Exploration of Online Science News
This paper deals with parsing and exploring transitivity in ten online science news articles in one of the leading national broadsheets in the Philippines. The corpus analysis used two software applications: AntConc and UAM Corpus.
Bonifacio Tala Cunanan
doaj +1 more source
Infinite transitivity on universal torsors
Let X be an algebraic variety covered by open charts isomorphic to the affine space and q: X' \to X be the universal torsor over X. We prove that the automorphism group of the quasiaffine variety X' acts on X' infinitely transitively.
Arzhantsev, Ivan +2 more
core +1 more source
On a Clique‐Building Game of Erdős
ABSTRACT The following game was introduced in a list of open problems from 1983 attributed to Erdős: two players take turns claiming edges of a Kn ${K}_{n}$ until all edges are exhausted. Player 1 wins the game if the largest clique that they claim at the end is strictly larger than the largest clique of their opponent; otherwise, Player 2 wins the ...
Alexandru Malekshahian, Sam Spiro
wiley +1 more source
Transitivity prominence in typological perspective: the case of Basque
This article contributes to the typological profile of Basque by discussing its status with respect to the parameter of transitivity prominence, i.e.
Denis Creissels
doaj +2 more sources

