Work

Extremal Graphs Without 4-Cycles

Year: 2012

Type: preprint

Abstract: We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1201.4912

Authors: Firke, Frank A., Kosek, Peter M., Nash, Evan D., Williford, Jason

Institutions: Carleton College, SUNY Brockport, University of Nebraska–Lincoln, University of Wyoming

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, University of Wyoming

Award: REU Site: Rocky Mountain Mathematical Research and Career Experiences

OpenAlex ID: W2951680327

Cites: 6

Cited by:

Related to: 20