Capturing Homogeneous Influence among Students: Hypergraph Cognitive Diagnosis for Intelligent Education Systems
Abstract
Supplemental Material
- Download
- 15.48 MB
References
Index Terms
- Capturing Homogeneous Influence among Students: Hypergraph Cognitive Diagnosis for Intelligent Education Systems
Recommendations
The Ramsey number for hypergraph cycles I
Let Cn denote the 3-uniform hypergraph loose cycle, that is the hypergraph with vertices v1.....,vn and edges v1v2v3, v3v4v5, v5v6v7,.....,vn-1vnv1. We prove that every red-blue colouring of the edges of the complete 3-uniform hypergraph with N vertices ...
Covering Non-uniform Hypergraphs
A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let (H) denote the cardinality of a minimum cover in the hypergraph H, and let us denote by g(n) the maximum of (H) taken over all hypergraphs H with n vertices and with no ...
Anti-Ramsey number of matchings in a hypergraph
AbstractGiven an edge-coloring of a hypergraph G, G is said to be rainbow if any two edges of G receive different colors. The anti-Ramsey number A R ( G , H ) of a hypergraph H in a hypergraph G is defined to be the maximum ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
- Natural Science Foundation of Shanghai
- Science and Technology Commission of Shanghai Municipality Grant
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 175Total Downloads
- Downloads (Last 12 months)175
- Downloads (Last 6 weeks)58
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in