Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
Dense graph
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Graph in which the number of edges is close to the maximum for its number of vertices
Property
Value
dbo:
description
matematikai fogalom a gráfelméletben
(hu)
graf cu un număr de muchii aproape de numărul de noduri
(ro)
граф, в котором число рёбер близко к максимальному
(ru)
rapporto tra numero di archi e di coppie di nodi del grafo
(it)
graph in which the number of edges is close to the maximum for its number of vertices
(en)
graphe dans lequel le nombre d'arêtes (ou d'arcs) est proche du nombre maximal
(fr)
grafo em que o número de arestas é próximo do máximo para o seu número de vértices
(pt)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Not_sparse_family.svg?width=300
dbo:
wikiPageExternalLink
https://xlinux.nist.gov/dads/HTML/sparsegraph.html
dbo:
wikiPageWikiLink
dbr
:Tree_(graph_theory)
dbr
:European_Journal_of_Combinatorics
dbr
:Lecture_Notes_in_Computer_Science
dbr
:Erdős–Stone_theorem
dbr
:Mathematics
dbr
:Directed_graph
dbr
:Vertex_(graph_theory)
dbr
:Bipartite_graph
dbr
:National_Institute_of_Standards_and_Technology
dbr
:Complete_graph
dbr
:Complete_bipartite_graph
dbr
:Graduate_Texts_in_Mathematics
dbr
:Outerplanar_graph
dbr
:Pseudoforest
dbr
:Arboricity
dbr
:Laman_graph
dbr
:Degeneracy_(graph_theory)
dbr
:Graph_(discrete_mathematics)
dbc
:Graph_families
dbr
:Planar_graph
dbr
:Superparticular_ratio
dbr
:Dense_subgraph
dbr
:Biclique-free_graph
dbr
:Bounded_expansion
dbr
:Infimum
dbr
:Journal_of_the_London_Mathematical_Society
dbr
:Somewhere_dense_(Graph_Theory)
dbr
:Rigidity_theory_(structural)
dbp:
wikiPageUsesTemplate
dbt
:Reflist
dbt
:Math
dbt
:Sfn
dbt
:Citation
dbt
:Sfrac
dbt
:CS1_config
dbt
:Mvar
dbt
:Abs
dbt
:Harvtxt
dbt
:Short_description
dct:
subject
dbc
:Graph_families
rdfs:
label
Dense graph
(en)
Graf dens
(ca)
Densidad (teoría de grafos)
(es)
Densità di un grafo
(it)
Densité d'un graphe
(fr)
밀집 그래프
(ko)
Плотный граф
(ru)
Щільний граф
(uk)
owl:
sameAs
freebase
:Dense graph
yago-res
:Dense graph
wikidata
:Dense graph
dbpedia-it
:Dense graph
dbpedia-fr
:Dense graph
dbpedia-es
:Dense graph
dbpedia-hu
:Dense graph
dbpedia-fa
:Dense graph
dbpedia-ru
:Dense graph
dbpedia-ko
:Dense graph
dbpedia-ca
:Dense graph
dbpedia-th
:Dense graph
dbpedia-uk
:Dense graph
dbpedia-global
:Dense graph
prov:
wasDerivedFrom
wikipedia-en
:Dense_graph?oldid=1288661277&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Not_sparse_family.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Dense_graph
is
dbo:
wikiPageRedirects
of
dbr
:Graph_density
dbr
:Sparse_graph
dbr
:Density_(graph_theory)
is
dbo:
wikiPageWikiLink
of
dbr
:Extremal_graph_theory
dbr
:Hamiltonian_path
dbr
:Glossary_of_graph_theory
dbr
:Clique_(graph_theory)
dbr
:Unit_distance_graph
dbr
:Floyd–Warshall_algorithm
dbr
:List_of_terms_relating_to_algorithms_and_data_structures
dbr
:Neighbourhood_(graph_theory)
dbr
:Independent_set_(graph_theory)
dbr
:Claw-free_graph
dbr
:Øystein_Ore
dbr
:Widest_path_problem
dbr
:Feedback_arc_set
dbr
:Beta_skeleton
dbr
:Bellman–Ford_algorithm
dbr
:Clique_problem
dbr
:Directed_acyclic_graph
dbr
:Szemerédi_regularity_lemma
dbr
:Fulkerson_Prize
dbr
:Paley_graph
dbr
:Graph_density
dbr
:Sparse_graph
dbr
:Graph_traversal
dbr
:Prim's_algorithm
dbr
:Crispin_Nash-Williams
dbr
:Arboricity
dbr
:List_of_graph_theory_topics
dbr
:Strong_orientation
dbr
:Hopcroft–Karp_algorithm
dbr
:Pancake_sorting
dbr
:Zero-suppressed_decision_diagram
dbr
:Degeneracy_(graph_theory)
dbr
:Pancake_graph
dbr
:Sparsity_matroid
dbr
:Béla_Bollobás
dbr
:Clique-width
dbr
:Equitable_coloring
dbr
:Social_network_analysis
dbr
:Triangle-free_graph
dbr
:Superparticular_ratio
dbr
:Karger's_algorithm
dbr
:Graphon
dbr
:Biclique-free_graph
dbr
:Yoshiharu_Kohayakawa
dbr
:Sparse_network
dbr
:Density_(graph_theory)
dbr
:Consumer_network
dbr
:Locally_linear_graph
dbr
:Maximum_cardinality_matching
dbr
:Incidence_poset
dbr
:Twin-width
dbr
:Harborth's_conjecture
is
foaf:
primaryTopic
of
wikipedia-en
:Dense_graph
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International