Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6086265
@@ Property / title @@
+Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05281
@@ Property / zbMATH Open document ID: 1365.05281 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-32589-2_63
@@ Property / DOI: 10.1007/978-3-642-32589-2_63 / rank @@
+Normal rank
@@ Property / author @@
+Sotiris E. Nikoletseas
@@ Property / author: Sotiris E. Nikoletseas / rank @@
+Normal rank
@@ Property / author @@
+Paul G. Spirakis
@@ Property / author: Paul G. Spirakis / rank @@
+Normal rank
@@ Property / published in @@
+Mathematical Foundations of Computer Science 2012
+Normal rank
@@ Property / publication date @@
+September 2012Timestamp +2012-09-25T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2012-09-25T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 25 September 2012 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6086265
@@ Property / zbMATH DE Number: 6086265 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3115081644
@@ Property / OpenAlex ID: W3115081644 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2964228864
@@ Property / OpenAlex ID: W2964228864 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4054
@@ Property / arXiv ID: 1204.4054 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on the bisection width for random \(d\)-regular graphs
+Normal rank
@@ Property / cites work @@
+The chromatic and clique numbers of random scaled sector graphs
+Normal rank
@@ Property / cites work @@
+Bounds on the max and min bisection of random cubic and random 4-regular graphs
+Normal rank
@@ Property / cites work @@
+Approximating layout problems on random graphs
@@ Property / cites work: Approximating layout problems on random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for maximum independent sets
@@ Property / cites work: Algorithms for maximum independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating Maximum Clique by Removing Subgraphs
+Normal rank
@@ Property / cites work @@
+Approximating the independence number via the \(\vartheta\)-function
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+On colouring random graphs
@@ Property / cites work: On colouring random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Large Cliques Elude the Metropolis Process
@@ Property / cites work: Large Cliques Elude the Metropolis Process / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705344
@@ Property / cites work: Q4705344 / rank @@
+Normal rank
@@ Property / cites work @@
+A spectral heuristic for bisecting random graphs
@@ Property / cites work: A spectral heuristic for bisecting random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Planted Partitions in Random Graphs with General Degree Distributions
+Normal rank
@@ Property / cites work @@
+On Random Intersection Graphs: The Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Coloring Random Intersection Graphs and Complex Networks
+Normal rank
@@ Property / cites work @@
+Efficiently covering complex networks with cliques of similar vertices
+Normal rank
@@ Property / cites work @@
+Q4948019
@@ Property / cites work: Q4948019 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of a random intersection graph and <i>G</i> (<i>n</i> ,<i>p</i> )
+Normal rank
@@ Property / cites work @@
+Maximum cliques in graphs with small intersection number and random intersection graphs
+Normal rank
@@ Property / cites work @@
+Large cliques in sparse random intersection graphs
+Normal rank
@@ Property / cites work @@
+Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints
+Normal rank
@@ Property / cites work @@
+On the independence number and Hamiltonicity of uniform random intersection graphs
+Normal rank

Latest revision as of 14:57, 27 July 2024

scientific article; zbMATH DE number 6086265

Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs

Language	Label	Description	Also known as
English	Maximum cliques in graphs with small intersection number and random intersection graphs	scientific article; zbMATH DE number 6086265	Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs