- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
1 Online-Ressource.
- Sprache
-
Englisch
- Erschienen in
-
Small Subgraphs with Large Average Degree ; day:15 ; month:4 ; year:2024 ; pages:1-16
Combinatorica ; (15.4.2024), 1-16
- Urheber
-
Janzer, Oliver
Sudakov, Benny
Tomon, István
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00493-024-00091-6
- URN
-
urn:nbn:de:101:1-2406272116173.568373733936
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 14.08.2025, 10:57 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Janzer, Oliver
- Sudakov, Benny
- Tomon, István
- SpringerLink (Online service)
Ähnliche Objekte (12)
On the average degree of characters
Average Degree of the Essential Variety
Polynomial Mappings with Small Degree
Degree-constrained editing of small-degree graphs
Degree-constrained editing of small-degree graphs
Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
Matching Cut in Graphs with Large Minimum Degree
Subdivisions of K_r+2} in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth
The average character degree of finite groups and Gluck’s conjecture
Incrementally updating the high average-utility patterns with pre-large concept
Topological dynamics of small degree networks
On small motions of systems with a single degree of freedom.
On the average degree of characters
Average Degree of the Essential Variety
Polynomial Mappings with Small Degree
Degree-constrained editing of small-degree graphs
Degree-constrained editing of small-degree graphs
Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
Matching Cut in Graphs with Large Minimum Degree
Subdivisions of K_r+2} in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth
The average character degree of finite groups and Gluck’s conjecture
Incrementally updating the high average-utility patterns with pre-large concept
Topological dynamics of small degree networks
On small motions of systems with a single degree of freedom.
On the average degree of characters
Average Degree of the Essential Variety
Polynomial Mappings with Small Degree
Degree-constrained editing of small-degree graphs
Degree-constrained editing of small-degree graphs
Incomplete pairwise comparison matrices based on graphs with average degree approximately 3
Matching Cut in Graphs with Large Minimum Degree
Subdivisions of K_r+2} in Graphs of Average Degree at Least r+epsilon and Large but Constant Girth
The average character degree of finite groups and Gluck’s conjecture
Incrementally updating the high average-utility patterns with pre-large concept
Topological dynamics of small degree networks