On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
From MaRDI portal
Publication:5434248
DOI10.1002/jgt.20251zbMath1128.05040OpenAlexW4234481233MaRDI 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
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (22)
A clique-free pseudorandom subgraph of the pseudo polarity graph ⋮ Triangle-free induced subgraphs of the unitary polarity graph ⋮ The isoperimetric number of the incidence graph of \(\operatorname{PG}(n,q)\) ⋮ The independence number for polarity graphs of even order planes ⋮ A note on eigenvalue bounds for independence numbers of non-regular graphs ⋮ 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 ⋮ Unnamed Item ⋮ New bounds on even cycle creating Hamiltonian paths using expander graphs ⋮ Occurrence of right angles in vector spaces over finite fields ⋮ Tight embeddings of partial quadrilateral packings ⋮ Some constructive bounds on Ramsey numbers ⋮ Structure and colour in triangle-free graphs ⋮ Orthogonal Polarity Graphs and Sidon Sets ⋮ On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs ⋮ Independent Sets in Polarity Graphs ⋮ A relative bound for independence ⋮ Cops and Robbers on Graphs Based on Designs ⋮ On the chromatic number of the Erdős-Rényi orthogonal polarity graph ⋮ Density of balanced 3-partite graphs without 3-cycles or 4-cycles
Cites Work
This page was built for publication: On the independence number of the Erdős‐Rényi and projective norm graphs and a related hypergraph
