On the density of subgraphs in a graph with bounded independence number (Q1272486): Difference between revisions

The maximum density of the \(k\)-subgraphs of any \(n\)-graph with independence number at most \(m\) is determined up to a multiplicative constant for all \(n,m,k\).

0 references

zbMATH Keywords

density

0 references

independence number

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Independence numbers of locally sparse graphs and a Ramsey type problem

0 references

0 references

0 references

0 references

0 references

An upper bound for some ramsey numbers

0 references

On the theory of graphs

0 references

Identifiers

zbMATH Open document ID

0916.05039

0 references

DOI

10.1006/jctb.1998.1818

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1272486

@@ Property / cites work @@
+Independence numbers of locally sparse graphs and a Ramsey type problem
+Normal rank
@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3866151
@@ Property / cites work: Q3866151 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4871773
@@ Property / cites work: Q4871773 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3825110
@@ Property / cites work: Q3825110 / rank @@
+Normal rank
@@ Property / cites work @@
+An upper bound for some ramsey numbers
@@ Property / cites work: An upper bound for some ramsey numbers / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of graphs
@@ Property / cites work: On the theory of graphs / rank @@
+Normal rank