Results 51 to 60 of about 351 (173)

A q$q$‐analogue of graph independence polynomials with a group‐theoretic interpretation

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 11, November 2026.
Abstract We define totally‐isotropic space polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally‐isotropic space polynomials of graphical alternating matrix spaces give rise to a natural q$q$‐analogue of graph independence polynomials. For p$p$‐groups of class
Youming Qiao
wiley   +1 more source

On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles

open access: yesRandom Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz   +2 more
wiley   +1 more source

Coloring the hypergraph of maximal cliques of a graph with no long path

open access: yesDiscrete Mathematics, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sylvain Gravier   +2 more
openaire   +2 more sources

H2CD: Semantic‐Enhanced Heterogeneous Hypergraph Network With Large Language Model for Cognitive Diagnosis

open access: yesCAAI Transactions on Intelligence Technology, Volume 11, Issue 5, Page 1463-1479, October 2026.
ABSTRACT Cognitive diagnosis aims to infer learners' knowledge states from their exercise responses, enabling personalised education at scale. Existing methods represent exercises solely by coarse‐grained knowledge component annotations, overlooking semantic content and step‐level cognitive processes.
Youheng Bai   +4 more
wiley   +1 more source

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree [PDF]

open access: yes, 2023
A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if $G_1, \dots, G_m$ are nearly disjoint graphs of maximum degree at most $D$, then the following holds. For every fixed $C$, if each
Kelly, Tom   +3 more
core   +1 more source

Rates of Evolution Differ Between Cell Types Identified by Single‐Cell RNAseq in Threespine Stickleback

open access: yesMolecular Ecology, Volume 35, Issue 19, October 2026.
ABSTRACT Rates of evolutionary change vary by gene. While some broad gene categories are highly conserved with little divergence over time, others undergo continuous selection pressure and are highly divergent among populations or species. But such comparative evolutionary studies rely on gene ontology categories that are rarely validated in the study ...
Maria L. Rodgers   +11 more
wiley   +1 more source

The complexity of 2-coloring and strong coloring in uniform hypergraphs of high minimum degree

open access: yes, 2013
Discrete AlgorithmsIn this paper we consider the problem of deciding whether a given r-uniform hypergraph H with minimum vertex degree at least c\binom|V(H)|-1r-1, or minimum degree of a pair of vertices at least c\binom|V(H)|-2r-2, has a vertex 2 ...
Edyta Szymańska, Szymańska, Edyta
core   +1 more source

On the chromatic number of general Kneser hypergraphs [PDF]

open access: yes, 2015
In a break-through paper, Lovász [20] determined the chromatic number of Kneser graphs. This was improved by Schrijver [27], by introducing the Schrijver subgraphs of Kneser graphs and showing that their chromatic number is the same as that of Kneser ...
Alishahi, Meysam   +3 more
core   +1 more source

Equivalence between Erdős–Hajnal and polynomial Rödl and Nikiforov conjectures

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract It is well‐known that polynomial versions of theorems of Rödl and Nikiforov, as conjectured by Fox and Sudakov and Nguyen, Scott and Seymour imply the classical Erdős–Hajnal conjecture. In this note, we prove that these three conjectures are in fact equivalent, extending several previous particular results in this direction by Fox, Nguyen ...
Matija Bucić, Jacob Fox, Huy Tuan Pham
wiley   +1 more source

Bounded diameter monochromatic component covers

open access: yesMathematika, Volume 72, Issue 4, October 2026.
Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley   +1 more source

Home - About - Disclaimer - Privacy