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:
Triangle-free graph
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Undirected graph in which no three vertices form a triangle of edges
Property
Value
dbo:
description
matematikai fogalom a gráfelméletben
(hu)
неориентированный граф, в котором никакие три вершины не образуют треугольник из рёбер
(ru)
undirected graph in which no three vertices form a triangle of edges
(en)
גרף בלתי מכוון בו אין שלושה קודקודים יוצרים משולש של קצוות
(iw)
dbo:
thumbnail
wiki-commons
:Special:FilePath/Biclique_K_5_5.svg?width=300
dbo:
wikiPageExternalLink
http://dl.acm.org/citation.cfm%3Fid=2627817.2627924
http://perso.ens-lyon.fr/stephan.thomasse/liste/vega11.pdf%7C
http://www.graphclasses.org/classes/gc_371.html
https://www.sciencedirect.com/science/article/pii/S0304020808735527
http://real.mtak.hu/110445/1/1974-18.pdf
https://semanticscholar.org/paper/26af19642d02045197c6b5a47a0691ea475ab747
https://semanticscholar.org/paper/600ab20562557a44611ef16b021aaf918002d672
https://semanticscholar.org/paper/0d19245a27bc65a87a8014d5b8a66fb514c8ff0b
dbo:
wikiPageWikiLink
dbr
:Girth_(graph_theory)
dbr
:Shift_graph
dbr
:Ramsey_number
dbr
:Mathematics
dbr
:Clique_(graph_theory)
dbr
:Andrásfai_graph
dbr
:Trace_(linear_algebra)
dbr
:Monochromatic_triangle
dbr
:Graph_theory
dbr
:Turán's_theorem
dbr
:Graph_coloring
dbr
:Grötzsch_graph
dbr
:Mycielskian
dbr
:Adjacency_matrix
dbr
:The_American_Mathematical_Monthly
dbr
:Complete_bipartite_graph
dbr
:Ruzsa–Szemerédi_problem
dbr
:Henson_graph
dbr
:Bipartite_graph
dbr
:Kneser_graph
dbr
:Median_graph
dbr
:Triangle_graph
dbr
:Planar_graph
dbr
:Grötzsch's_theorem
dbr
:Regular_graph
dbr
:Neighbourhood_(graph_theory)
dbr
:Independent_set_(graph_theory)
dbr
:Matrix_multiplication
dbr
:Maximal_independent_set
dbr
:Induced_path
dbr
:Blanche_Descartes
dbr
:Pigeonhole_principle
dbr
:Quantum_algorithm
dbr
:Eureka_(University_of_Cambridge_magazine)
dbr
:SIAM_Journal_on_Computing
dbr
:SIAM_Journal_on_Discrete_Mathematics
dbr
:Dense_graph
dbr
:Discrete_Mathematics_(journal)
dbr
:Advances_in_Mathematics
dbr
:Chromatic_number
dbc
:Graph_families
dbr
:Query_complexity
dbr
:Decision_tree_complexity
dbr
:Journal_of_Combinatorial_Theory,_Series_B
dbr
:Tutte
dbr
:File:Biclique_K_5_5.svg
dbr
:File:Groetzsch_graph_4COL.svg
dbp:
wikiPageUsesTemplate
dbt
:Citation
dbt
:Harvtxt
dbt
:Math
dbt
:Mvar
dbt
:Refbegin
dbt
:Refend
dbt
:Reflist
dbt
:Sfnp
dbt
:Short_description
dbt
:Sup
dct:
subject
dbc
:Graph_families
gold:
hypernym
dbr
:Graph
rdfs:
label
Triangle-free graph
(en)
Graphe sans triangle
(fr)
Grafos sin triángulos
(es)
Grafos sem triangulos
(pt)
Граф без треугольников
(ru)
Граф без трикутників
(uk)
owl:
sameAs
freebase
:Triangle-free graph
yago-res
:Triangle-free graph
wikidata
:Triangle-free graph
dbpedia-es
:Triangle-free graph
dbpedia-fr
:Triangle-free graph
dbpedia-hu
:Triangle-free graph
dbpedia-pt
:Triangle-free graph
dbpedia-ru
:Triangle-free graph
dbpedia-fa
:Triangle-free graph
dbpedia-uk
:Triangle-free graph
dbpedia-global
:Triangle-free graph
prov:
wasDerivedFrom
wikipedia-en
:Triangle-free_graph?oldid=1296437252&ns=0
foaf:
depiction
wiki-commons
:Special:FilePath/Biclique_K_5_5.svg
wiki-commons
:Special:FilePath/Groetzsch_graph_4COL.svg
foaf:
isPrimaryTopicOf
wikipedia-en
:Triangle-free_graph
is
dbo:
wikiPageRedirects
of
dbr
:Triangle-free
dbr
:Triangle_finding_problem
is
dbo:
wikiPageWikiLink
of
dbr
:Combinatorics
dbr
:Herbert_Grötzsch
dbr
:Girth_(graph_theory)
dbr
:Zdeněk_Dvořák
dbr
:Moser_spindle
dbr
:Circle_graph
dbr
:Second_neighborhood_problem
dbr
:Shift_graph
dbr
:Clique_(graph_theory)
dbr
:Butterfly_graph
dbr
:Gewirtz_graph
dbr
:Andrásfai_graph
dbr
:Forbidden_graph_characterization
dbr
:Monochromatic_triangle
dbr
:Clique_cover
dbr
:Chordal_bipartite_graph
dbr
:Interval_edge_coloring
dbr
:Penny_graph
dbr
:Property_testing
dbr
:Turán's_theorem
dbr
:Three_utilities_problem
dbr
:Cycle_(graph_theory)
dbr
:Claw-free_graph
dbr
:Simplex_graph
dbr
:Locally_linear_graph
dbr
:Andrew_M._Gleason
dbr
:Brooks'_theorem
dbr
:Clebsch_graph
dbr
:Graph_coloring
dbr
:Grötzsch_graph
dbr
:Jan_Mycielski
dbr
:Mycielskian
dbr
:Schläfli_graph
dbr
:Graph_property
dbr
:Complement_graph
dbr
:Complete_bipartite_graph
dbr
:Ramsey's_theorem
dbr
:Cycle_double_cover
dbr
:Ruzsa–Szemerédi_problem
dbr
:Henson_graph
dbr
:Unit_distance_graph
dbr
:Glossary_of_graph_theory
dbr
:Brinkmann_graph
dbr
:Bull_graph
dbr
:Diamond_graph
dbr
:Franklin_graph
dbr
:Harries_graph
dbr
:Harries–Wong_graph
dbr
:Median_graph
dbr
:Outerplanar_graph
dbr
:Toroidal_graph
dbr
:Triangle_graph
dbr
:Wagner_graph
dbr
:Apex_graph
dbr
:Hajós_construction
dbr
:Grötzsch's_theorem
dbr
:Interval_graph
dbr
:List_coloring
dbr
:Neighbourhood_(graph_theory)
dbr
:Perfect_graph_theorem
dbr
:Halin_graph
dbr
:Scheinerman's_conjecture
dbr
:Folded_cube_graph
dbr
:Rainbow-independent_set
dbr
:Edge_coloring
dbr
:Arrangement_of_lines
dbr
:Squaregraph
dbr
:Maximal_independent_set
dbr
:Induced_path
dbr
:Four_color_theorem
dbr
:Caterpillar_tree
dbr
:Intersection_number_(graph_theory)
dbr
:Rainbow_matching
dbr
:Subcoloring
dbr
:Χ-bounded
dbr
:Strongly_regular_graph
dbr
:Bidiakis_cube
dbr
:Clique_problem
dbr
:Distance-hereditary_graph
dbr
:Friendship_graph
dbr
:Implicit_graph
dbr
:Chvátal_graph
dbr
:Václav_Chvátal
dbr
:Walk-regular_graph
dbr
:Triangle-free
dbr
:Triangle_finding_problem
is
dbp:
properties
of
dbr
:Gewirtz_graph
dbr
:Andrásfai_graph
dbr
:Grötzsch_graph
dbr
:Franklin_graph
dbr
:Harries_graph
dbr
:Harries–Wong_graph
dbr
:Wagner_graph
dbr
:Bidiakis_cube
dbr
:Chvátal_graph
is
foaf:
primaryTopic
of
wikipedia-en
:Triangle-free_graph
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International