Results 121 to 130 of about 85,296 (298)

Covering Graphs with Few Complete Bipartite Subgraphs

Theoretical Computer Science, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fleischner, H., Mujuni, E., Paulusma, Daniel, Szeider, S.   +3 more
openaire   +2 more sources

A Hierarchical Niche Structure, Not Niche Partitioning, Organizes a Seasonally Dynamic Flea Community

Ecology and Evolution, Volume 16, Issue 1, January 2026.
Using seasonal data from a single‐host system (Mongolian gerbil‐flea), we show that community organization is governed by a hierarchical niche structure rather than classic niche partitioning. Network analyses reveal a persistent generalist core with seasonally shifting peripheries (spring assembly, summer integration, autumn reorganization).
Rui Geng, Yakun Liu, Guokang Chen, Haizhou Yang, Shuai Yuan, Heping Fu   +5 more
wiley   +1 more source

Steiner Triple Systems With High Discrepancy

Journal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner, Stefan Glock, Amedeo Sgueglia   +2 more
wiley   +1 more source

Bipartite Digraphs with Modular Concept Lattices of height 2

Қарағанды университетінің хабаршысы. Математика сериясы
This paper investigates the interaction between Formal Concept Analysis (FCA) and graph theory, with a focus on understanding the structure and representation of concept lattices derived from bipartite directed graphs.
A.O. Basheyeva, A.T. Zhussupova, Y.K. Nurlibayev   +2 more
doaj   +1 more source

Decomposition of an infinite complete graph into complete bipartite subgraphs [PDF]

, 1984
Bohdan Zelinka
openalex   +1 more source

On bipartite graphs with complete bipartite star complements

Linear Algebra and its Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs

Journal of Combinatorial Designs, Volume 34, Issue 1, Page 31-36, January 2026.
ABSTRACT Let Q be an n × n array whose top left r × s sub‐array L is filled with a set of k different symbols such that each cell of L contains λ symbols. In this note, we find conditions under which each empty cell of Q can be filled with λ symbols in such a way that the total number of occurrences of each symbol is prescribed and that each symbol ...
Amin Bahmanian
wiley   +1 more source

An Approach to the Girth Problem in Cubic Graphs

Journal of Graph Theory, Volume 111, Issue 1, Page 17-26, January 2026.
ABSTRACT We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all n‐vertex cubic graphs is attained by a 2‐connected graph G = ( V , E ). By Petersen's graph theorem, E is the disjoint union of a 2‐factor and a perfect matching M.
Aya Bernstine, Nati Linial
wiley   +1 more source

Computing the number of h-edge spanning forests in complete bipartite graphs [PDF]

, 2014
Rebecca J. Stones
openalex   +1 more source

Transformer Learning in Sequence‐Based Drug Design Depends on Compound Memorization and Similarity of Sequence‐Compound Pairs

Molecular Informatics, Volume 45, Issue 1, January 2026.
Transformer model. Shown is a schematic representation of an encoder‐decoder transformer trained for protein sequence‐based compound design. Chemical language models (CLMs), particularly encoder‐decoder transformers, have advanced generative molecular design.
Jürgen Bajorath
wiley   +1 more source