On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph

DOI10.1002/jgt.20251zbMath1128.05040MaRDI QIDQ5434248

Dhruv Mubayi, Jason S. Williford

Publication date: 4 January 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20251

zbMATH Keywords

eigenvalues; independence number; finite projective planes; polarity graphs

Mathematics Subject Classification ID

05C65: Hypergraphs

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

Unnamed Item, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Incidence‐free sets and edge domination in incidence graphs, A note on 3‐partite graphs without 4‐cycles, A note on pseudorandom Ramsey graphs, The independence number for polarity graphs of even order planes, A note on eigenvalue bounds for independence numbers of non-regular graphs, Tight embeddings of partial quadrilateral packings, Some constructive bounds on Ramsey numbers, On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs, Triangle-free induced subgraphs of the unitary polarity graph, The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\), Occurrence of right angles in vector spaces over finite fields, Structure and colour in triangle-free graphs, Density of balanced 3-partite graphs without 3-cycles or 4-cycles, A clique-free pseudorandom subgraph of the pseudo polarity graph, New bounds on even cycle creating Hamiltonian paths using expander graphs, A relative bound for independence, On the chromatic number of the Erdős-Rényi orthogonal polarity graph, Orthogonal Polarity Graphs and Sidon Sets, Independent Sets in Polarity Graphs, Cops and Robbers on Graphs Based on Designs

Cites Work

• Unnamed Item
• Unnamed Item
• On Graphs that do not Contain a Thomsen Graph