Class information for: |
Basic class information |
Class id | #P | Avg. number of references |
Database coverage of references |
---|---|---|---|
21305 | 425 | 13.0 | 42% |
Hierarchy of classes |
The table includes all classes above and classes immediately below the current class. |
Cluster id | Level | Cluster label | #P |
---|---|---|---|
9 | 4 | COMPUTER SCIENCE, THEORY & METHODS//COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE//COMPUTER SCIENCE, INFORMATION SYSTEMS | 1247339 |
181 | 3 | DISCRETE MATHEMATICS//JOURNAL OF GRAPH THEORY//MATHEMATICS | 56539 |
303 | 2 | DISCRETE MATHEMATICS//JOURNAL OF GRAPH THEORY//JOURNAL OF COMBINATORIAL THEORY SERIES B | 18557 |
21305 | 1 | BLOW UP LEMMA//ABSORBING METHOD//VERTEX DISJOINT | 425 |
Terms with highest relevance score |
rank | Term | termType | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|---|
1 | BLOW UP LEMMA | authKW | 718470 | 2% | 100% | 10 |
2 | ABSORBING METHOD | authKW | 653153 | 2% | 91% | 10 |
3 | VERTEX DISJOINT | authKW | 653153 | 2% | 91% | 10 |
4 | VERTEX DISJOINT CYCLES | authKW | 527908 | 3% | 57% | 13 |
5 | CHORDED CYCLES | authKW | 440061 | 2% | 88% | 7 |
6 | PACKING OF GRAPHS | authKW | 431082 | 1% | 100% | 6 |
7 | REGULARITY LEMMA | authKW | 422266 | 5% | 26% | 23 |
8 | GRAPH PACKING | authKW | 337265 | 3% | 36% | 13 |
9 | CYCLE COVERINGS | authKW | 287388 | 1% | 100% | 4 |
10 | PACKING GRAPHS | authKW | 287388 | 1% | 100% | 4 |
Web of Science journal categories |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | Mathematics | 18801 | 89% | 0% | 380 |
2 | Mathematics, Applied | 550 | 15% | 0% | 65 |
3 | Statistics & Probability | 156 | 5% | 0% | 22 |
4 | Computer Science, Theory & Methods | 155 | 6% | 0% | 25 |
5 | Computer Science, Software Engineering | 63 | 3% | 0% | 14 |
6 | Computer Science, Information Systems | 0 | 1% | 0% | 3 |
7 | Mathematics, Interdisciplinary Applications | -0 | 0% | 0% | 2 |
8 | Operations Research & Management Science | -1 | 0% | 0% | 1 |
9 | Engineering, General | -1 | 0% | 0% | 1 |
10 | Computer Science, Interdisciplinary Applications | -1 | 0% | 0% | 1 |
Address terms |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | LEHRSTUHL OPERAT WIRT AFTSINFORMAT | 143694 | 0% | 100% | 2 |
2 | FAK MATH WISSEN | 71847 | 0% | 100% | 1 |
3 | KATEDRA MATEMAT DYSKRETNEJ | 71847 | 0% | 100% | 1 |
4 | LRI UA 410 CNRS | 71847 | 0% | 100% | 1 |
5 | MATH MATH STUDIES | 71847 | 0% | 100% | 1 |
6 | URA 410 CNRS | 46183 | 1% | 21% | 3 |
7 | DISCRETE MATH | 42289 | 4% | 4% | 15 |
8 | CMA UNL | 35923 | 0% | 50% | 1 |
9 | EPFL SB IMB DCG | 35923 | 0% | 50% | 1 |
10 | HEWLETT PACKARD | 23948 | 0% | 33% | 1 |
Journals |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
---|---|---|---|---|---|
1 | DISCRETE MATHEMATICS | 90178 | 28% | 1% | 121 |
2 | JOURNAL OF GRAPH THEORY | 60071 | 11% | 2% | 46 |
3 | GRAPHS AND COMBINATORICS | 56311 | 9% | 2% | 39 |
4 | JOURNAL OF COMBINATORIAL THEORY SERIES B | 26561 | 7% | 1% | 29 |
5 | COMBINATORICS PROBABILITY & COMPUTING | 25545 | 4% | 2% | 18 |
6 | SIAM JOURNAL ON DISCRETE MATHEMATICS | 14027 | 5% | 1% | 20 |
7 | COMBINATORICA | 12016 | 4% | 1% | 15 |
8 | DISCUSSIONES MATHEMATICAE GRAPH THEORY | 10310 | 2% | 2% | 7 |
9 | ARS COMBINATORIA | 9380 | 5% | 1% | 22 |
10 | EUROPEAN JOURNAL OF COMBINATORICS | 5969 | 4% | 1% | 16 |
Author Key Words |
Rank | Term | Chi square | Shr. of publ. in class containing term |
Class's shr. of term's tot. occurrences |
#P with term in class |
LCSH search | Wikipedia search |
---|---|---|---|---|---|---|---|
1 | BLOW UP LEMMA | 718470 | 2% | 100% | 10 | Search BLOW+UP+LEMMA | Search BLOW+UP+LEMMA |
2 | ABSORBING METHOD | 653153 | 2% | 91% | 10 | Search ABSORBING+METHOD | Search ABSORBING+METHOD |
3 | VERTEX DISJOINT | 653153 | 2% | 91% | 10 | Search VERTEX+DISJOINT | Search VERTEX+DISJOINT |
4 | VERTEX DISJOINT CYCLES | 527908 | 3% | 57% | 13 | Search VERTEX+DISJOINT+CYCLES | Search VERTEX+DISJOINT+CYCLES |
5 | CHORDED CYCLES | 440061 | 2% | 88% | 7 | Search CHORDED+CYCLES | Search CHORDED+CYCLES |
6 | PACKING OF GRAPHS | 431082 | 1% | 100% | 6 | Search PACKING+OF+GRAPHS | Search PACKING+OF+GRAPHS |
7 | REGULARITY LEMMA | 422266 | 5% | 26% | 23 | Search REGULARITY+LEMMA | Search REGULARITY+LEMMA |
8 | GRAPH PACKING | 337265 | 3% | 36% | 13 | Search GRAPH+PACKING | Search GRAPH+PACKING |
9 | CYCLE COVERINGS | 287388 | 1% | 100% | 4 | Search CYCLE+COVERINGS | Search CYCLE+COVERINGS |
10 | PACKING GRAPHS | 287388 | 1% | 100% | 4 | Search PACKING+GRAPHS | Search PACKING+GRAPHS |
Core articles |
The table includes core articles in the class. The following variables is taken into account for the relevance score of an article in a cluster c: (1) Number of references referring to publications in the class. (2) Share of total number of active references referring to publications in the class. (3) Age of the article. New articles get higher score than old articles. (4) Citation rate, normalized to year. |
Rank | Reference | # ref. in cl. |
Shr. of ref. in cl. |
Citations |
---|---|---|---|---|
1 | HAN, J , ZHAO, Y , (2015) MINIMUM VERTEX DEGREE THRESHOLD FOR LOOSE HAMILTON CYCLES IN 3-UNIFORM HYPERGRAPHS.JOURNAL OF COMBINATORIAL THEORY SERIES B. VOL. 114. ISSUE . P. 70 -96 | 22 | 100% | 2 |
2 | MYCROFT, R , (2016) PACKING K-PARTITE K-UNIFORM HYPERGRAPHS.JOURNAL OF COMBINATORIAL THEORY SERIES A. VOL. 138. ISSUE . P. 60 -132 | 23 | 85% | 1 |
3 | BOTTCHER, J , HEINIG, P , TARAZ, A , (2010) EMBEDDING INTO BIPARTITE GRAPHS.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 24. ISSUE 4. P. 1215-1233 | 26 | 90% | 1 |
4 | HAN, J , ZHAO, Y , (2016) FORBIDDING HAMILTON CYCLES IN UNIFORM HYPERGRAPHS.JOURNAL OF COMBINATORIAL THEORY SERIES A. VOL. 143. ISSUE . P. 107 -115 | 20 | 100% | 0 |
5 | HAN, J , (2016) NEAR PERFECT MATCHINGS IN K-UNIFORM HYPERGRAPHS II.SIAM JOURNAL ON DISCRETE MATHEMATICS. VOL. 30. ISSUE 3. P. 1453 -1469 | 20 | 100% | 0 |
6 | BOTTCHER, J , SCHACHT, M , TARAZ, A , (2008) SPANNING 3-COLOURABLE SUBGRAPHS OF SMALL BANDWIDTH IN DENSE GRAPHS.JOURNAL OF COMBINATORIAL THEORY SERIES B. VOL. 98. ISSUE 4. P. 752-777 | 22 | 96% | 1 |
7 | KHAN, I , (2016) PERFECT MATCHINGS IN 4-UNIFORM HYPERGRAPHS.JOURNAL OF COMBINATORIAL THEORY SERIES B. VOL. 116. ISSUE . P. 333 -366 | 13 | 100% | 4 |
8 | RODL, V , RUCINSKI, A , (2014) FAMILIES OF TRIPLES WITH HIGH MINIMUM DEGREE ARE HAMILTONIAN.DISCUSSIONES MATHEMATICAE GRAPH THEORY. VOL. 34. ISSUE 2. P. 361 -381 | 17 | 100% | 2 |
9 | BOTTCHER, J , SCHACHT, M , TARAZ, A , (2009) PROOF OF THE BANDWIDTH CONJECTURE OF BOLLOBAS AND KOMLOS.MATHEMATISCHE ANNALEN. VOL. 343. ISSUE 1. P. 175 -205 | 17 | 100% | 7 |
10 | LENZ, J , MUBAYI, D , (2016) PERFECT PACKINGS IN QUASIRANDOM HYPERGRAPHS I.JOURNAL OF COMBINATORIAL THEORY SERIES B. VOL. 119. ISSUE . P. 155 -177 | 19 | 76% | 0 |
Classes with closest relation at Level 1 |